SCOPUS 정보 검색 플랫폼

Volumn 155, Issue 15, 2007, Pages 1958-1970

Least and most colored bases

Author keywords

Approximation algorithms; k matroid intersection; k for 1 property; Low chromatics; Matroids; Minimum label spanning tree; MLST

Indexed keywords

APPROXIMATION ALGORITHMS; FUNCTION EVALUATION; OPTIMIZATION; SET THEORY;

LOW CHROMATICS; MINIMUM LABEL SPANNING TREE;

MATRIX ALGEBRA;

EID: 34547765839 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/j.dam.2007.04.015 Document Type: Article

Times cited : (6)

References (11)

1
- 84995344698
- Structure preserving reductions among convex optimization problems
- Ausiello G., D'Atri A., and Protasi M. Structure preserving reductions among convex optimization problems. J. Comput. System Sci. 50 21 (1980) 136-153
- (1980) J. Comput. System Sci. , vol.50 , Issue.21 , pp. 136-153
- Ausiello, G.¹ D'Atri, A.² Protasi, M.³

2
- 0037232787
- Wavelength rerouting in optical networks, or the Venetian routing problem
- Caprara A., Italiano G., Mohan G., Panconesi A., and Srinivasan A. Wavelength rerouting in optical networks, or the Venetian routing problem. J. Algorithms 45 2 (2002) 93-125
- (2002) J. Algorithms , vol.45 , Issue.2 , pp. 93-125
- Caprara, A.¹ Italiano, G.² Mohan, G.³ Panconesi, A.⁴ Srinivasan, A.⁵

3
- 0031221179
- The minimum labeling spanning trees
- Chang R.S., and Leu S.J. The minimum labeling spanning trees. Inform. Process. Lett. 63 5 (1997) 277-282
- (1997) Inform. Process. Lett. , vol.63 , Issue.5 , pp. 277-282
- Chang, R.S.¹ Leu, S.J.²

4
- 27744567233
- Matroids and the greedy algorithm
- Edmonds J. Matroids and the greedy algorithm. Math. Programming 1 (1971) 127-136
- (1971) Math. Programming , vol.1 , pp. 127-136
- Edmonds, J.¹

5
- 0000109157
- 1 - ε{lunate}
- 1 - ε{lunate}. Acta Math. 182 (1999) 105-142
- (1999) Acta Math. , vol.182 , pp. 105-142
- Håstad, J.¹

6
- 0025855578
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Kann V. Maximum bounded 3-dimensional matching is MAX SNP-complete. Inform. Process. Lett. 37 (1991) 27-35
- (1991) Inform. Process. Lett. , vol.37 , pp. 27-35
- Kann, V.¹

7
- 0003590794
- Springer, Berlin ISBN: 3-540-43154-3
- Korte B., and Vygen J. Combinatorial optimization. Theory and algorithms. Algorithms and Combinatorics vol. 21 (2002), Springer, Berlin ISBN: 3-540-43154-3
- (2002) Combinatorial optimization. Theory and algorithms. Algorithms and Combinatorics , vol.21
- Korte, B.¹ Vygen, J.²

8
- 0032046528
- On the minimum label spanning tree problem
- Krumke S.O., and Wirth H.C. On the minimum label spanning tree problem. Inform. Process. Lett. 66 2 (1998) 81-85
- (1998) Inform. Process. Lett. , vol.66 , Issue.2 , pp. 81-85
- Krumke, S.O.¹ Wirth, H.C.²

9
- 0004061262
- Oxford Science Publications, The Clarendon Press, Oxford University Press, New York ISBN: 0-19-853563-5
- Oxley J.G. Matroid Theory (1992), Oxford Science Publications, The Clarendon Press, Oxford University Press, New York ISBN: 0-19-853563-5
- (1992) Matroid Theory
- Oxley, J.G.¹

10
- 0013169095
- Springer, Berlin ISBN: 3-540-44389-4
- Schrijver A. Combinatorial Optimization. Polyhedra and Efficiency (2003), Springer, Berlin ISBN: 3-540-44389-4
- (2003) Combinatorial Optimization. Polyhedra and Efficiency
- Schrijver, A.¹

11
- 0037206514
- A note on the minimum label spanning tree
- Wan Y., Chen G., and Xu Y. A note on the minimum label spanning tree. Inform. Process. Lett. 84 (2002) 99-101
- (2002) Inform. Process. Lett. , vol.84 , pp. 99-101
- Wan, Y.¹ Chen, G.² Xu, Y.³

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.