Abstract
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a small subgraph which contains optimal or near optimal solution for every possible value of the given parameter? Such a subgraph is said to be robust. In this paper we consider the problems of finding heavy paths and heavy trees of k edges. In these two cases we prove surprising bounds on the size of a robust subgraph for a variety of approximation ratios. For both problems we show that in every complete weighted graph on n vertices there exists a subgraph with approximately \(\frac{\alpha}{1 - \alpha^2}n\) edges which contains an α-approximate solution for every k = 1, ..., n–1. In the analysis of the tree problem we also describe a new result regarding balanced decomposition of trees. In addition, we consider variations in which the subgraph itself is restricted to be a path or a tree. For these problems we describe polynomial time algorithms and corresponding proofs of negative results.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arora, S., Karakostas, G.: A 2+ ε approximation algorithm for the k-MST problem. In: Proc. SIAM Symp. on Discrete Algorithms (2000)
Feige, U., Kortsarz, G., Peleg, D.: The dense k-subgraph problem. Algorithmica 29, 410–421 (2001)
Frederickson, G.N., Johnson, D.B.: Generating and searching sets induced by network , LNCS, vol. 85, pp. 221–233 (1980)
Gale, D.: Optimal assignments in an ordered set: An application of matroid theory. J. of Combinatorial 4, 176–180 (1968)
Garg, N.: A 3-approximation for the minimum tree spanning k vertices. In: Proc. IEEE Symp. on Foundations of Computer Science (1996), pp. 302–309 (1996)
Goldman, A.J.: Optimal center location in simple networks. Transportation Sci. 5, 212–221 (1971)
Hassin, R., Rubinstein, S.: Robust matchings. SIAM J. Disc. Math. 15, 530–537 (2002)
Hassin, R., Rubinstein, S., Tamir, A.: Approximation algorithms for maximum dispersion. Operations Research Letters 21, 133–137 (1997)
Kariv, O., Hakimi, L.: An algorithmic approach to network location problems. I: The p-centers. SIAM J. Appl. Math. 37, 513–538 (1979)
Mirchandani, P.B., Francis, R.L.: Discrete Location Theory, New York. Wiley- Interscience Series in Discrete Mathematics and Optimization (1990)
Lawler, E.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston (1976)
Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hassin, R., Segev, D. (2004). Robust Subgraphs for Trees and Paths. In: Hagerup, T., Katajainen, J. (eds) Algorithm Theory - SWAT 2004. SWAT 2004. Lecture Notes in Computer Science, vol 3111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27810-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-27810-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22339-9
Online ISBN: 978-3-540-27810-8
eBook Packages: Springer Book Archive