Abstract
In the paper a problem of finding a maximum-weight spanning connected subgraph with given vertex degrees is considered. The problem is MAX SNP-hard, because it is a generalization of a well-known Traveling Salesman Problem. Approximation algorithms are constructed for deterministic and random instances. Performance bounds of these algorithms are presented.
This research was supported by the Russian Foundation for Basic Research (grant 02-01-01153), program of supporting of leading science schools of Russia (project “Nauchnaya Shkola - 313.2003.1”), and INTAS (grant 00-217)
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
R. G. Busacker, T. L. Saaty: Finite Graphs and Networks: an Introduction with Applications, McGraw Hill, New York (1965).
J. Edmonds, E. L. Johnson: Matchings: a well solvable class of integer linear programs, Combinatorial Structures and their Applications, Gordon and Breach, New York (1970), 89–92.
H. N. Gabow: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems, Proceedings of the 15th annual ACM symposium on theory of computing, Boston, Apr. 25–27, ACM, New York (1983), 448–456.
E. Kh. Gimadi, A. I. Serdukov: A problem of finding the maximal spanning connected subgraph with given vertex degrees, Oper. Res. Proc. 2000, Springer Verlag (2001), 55–59.
E. Kh. Gimadi, N. I. Glebov, V. A. Perepelitsa: Algorithms with estimates for discrete optimization problems, Problemy Kibernetiki, Nauka, Moskva, vol.31 (1976), 35–42, in Russian.
F. Harary: Graph Theory, Addison-Wesley, Reading, Massachusetts (1969).
V. Havel: A note to question of existance of finite graphs, Casopis Pest Mat., 80 (1955), 477–480.
V. V. Petrov: Limit Theorems of Probability Theory. Oxford Univ. Press (1995).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baburin, A.E., Gimadi, E.K. (2005). Approximation Algorithms for Finding a Maximum-Weight Spanning Connected Subgraph with given Vertex Degrees. In: Fleuren, H., den Hertog, D., Kort, P. (eds) Operations Research Proceedings 2004. Operations Research Proceedings, vol 2004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27679-3_43
Download citation
DOI: https://doi.org/10.1007/3-540-27679-3_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24274-1
Online ISBN: 978-3-540-27679-1
eBook Packages: Business and EconomicsBusiness and Management (R0)