Robust subgraphs for trees and paths

ACM Transactions on Algorithms

Volumn 2, Issue 2, 2006, Pages 263-281

  Hassin, Refael ^a   Segev, Danny ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithms; Decomposition; Robust optimization; Spanning trees

Indexed keywords

OPTIMAL SOLUTION; SPANNING TREES; SUBGRAPH; TREES DECOMPOSITION;

ALGORITHMS; APPROXIMATION THEORY; POLYNOMIALS; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS); TREES (MATHEMATICS);

GRAPH THEORY;

EID: 33747728231     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1150334.1150341     Document Type: Article

References (8)

1. ARORA, S., AND KARAKOSTAS, G. 2000. A 2 + ε approximation algorithm for the k-MST problem. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 754-759.
2. FEIGE, U., PELEG, D., AND KORTSARZ, G. 2001. The dense k-subgraph problem. Algorithmica 29, 410-421.
3. FREDERICKSON, G. N., AND JOHNSON, D. B. 1980. Generating and searching sets induced by networks. In Proceedings of the 7th International Colloquium on Automata, Languages and Programming. 221-233.
4. GALE, D. 1968. Optimal assignments in an ordered set: An application of matroid theory. J. Combinat. Theory 4, 176-180.
5. GARG, N. 1996. A 3-approximation for the minimum tree spanning k vertices. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 302-309.
6. HASSIN, R., AND RUBINSTEIN, S. 2002. Robust matchings. SIAM J. Disc. Math. 15, 530-537.
7. HASSIN, R., RUBINSTEIN, S., AND TAMIR, A. 1997. Approximation algorithms for maximum dispersion. Oper. Res. Lett. 21, 133-137.
8. MIRCHANDANI, P. B., AND FRANCIS, R. L. 1990. Discrete Location Theory. Wiley-lnterscience Series in Discrete Mathematics and Optimization, Wiley, New York.