Abstract
We consider two related problems, the Minimum Bounded Degree Matroid Basis problem and the Minimum Bounded Degree Submodular Flow problem. The first problem is a generalization of the Minimum Bounded Degree Spanning Tree problem: we are given a matroid and a hypergraph on its ground set with lower and upper bounds f(e) ≤ g(e) for each hyperedge e. The task is to find a minimum cost basis which contains at least f(e) and at most g(e) elements from each hyperedge e. In the second problem we have a submodular flow problem, a lower bound f(v) and an upper bound g(v) for each node v, and the task is to find a minimum cost 0-1 submodular flow with the additional constraint that the sum of the incoming and outgoing flow at each node v is between f(v) and g(v). Both of these problems are NP-hard (even the feasibility problems are NP-complete), but we show that they can be approximated in the following sense. Let opt be the value of the optimal solution. For the first problem we give an algorithm that finds a basis B of cost no more than opt such that f(e) − 2Δ + 1 ≤ |B ∩ e| ≤ g(e) + 2Δ− 1 for every hyperedge e, where Δ is the maximum degree of the hypergraph. If there are only upper bounds (or only lower bounds), then the violation can be decreased to Δ− 1. For the second problem we can find a 0-1 submodular flow of cost at most opt where the sum of the incoming and outgoing flow at each node v is between f(v) − 1 and g(v) + 1. These results can be applied to obtain approximation algorithms for different combinatorial optimization problems with degree constraints, including the Minimum Crossing Spanning Tree problem, the Minimum Bounded Degree Spanning Tree Union problem, the Minimum Bounded Degree Directed Cut Cover problem, and the Minimum Bounded Degree Graph Orientation problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bansal, N., Khandekar, R., Nagarajan, V.: Additive Guarantees for Degree Bounded Directed Network Design, IBM Research Report RC24347 (September 2007)
Bilo, V., Goyal, V., Ravi, R., Singh, M.: On the Crossing Spanning Tree Problem. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 51–60. Springer, Heidelberg (2004)
Chaudhuri, K., Rao, S., Riesenfeld, S., Talwar, K.: A Push-Relabel Algorithm for Approximating the Minimum-Degree MST Problem and its Generalization to Matroids, Invited submission to Theoretical Computer Science (Special Issue for ICALP 2006) (2006)
Cunningham, W.H.: Testing membership in matroid polyhedra. Journal of Combinatorial Theory, Series B 36(2), 161–188 (1984)
Edmonds, J., Giles, R.: A min-max relation for submodular functions on graphs. Ann. Discrete Math. 1, 185–204 (1977)
Frank, A.: An algorithm for submodular functions on graphs. Ann. Discrete Math. 16, 97–120 (1982)
Frieze, A.: Personal Communication (March 2007)
Goemans, M.X.: Minimum bounded-degree spanning trees. In: Proceedings of 47th IEEE FOCS, pp. 273–282 (2006)
Jain, K.: A factor 2 approxiamtion algorithm for the generalized Steiner network problem. Combinatorica 21, 39–60 (2001)
Lau, L.C., Naor, J., Salavatipour, M., Singh, M.: Survivable network design with degree or order constraints. In: Proceedings of 39th ACM STOC, pp. 651–660 (2007)
Schrijver, A.: Combinatorial Optimization, Polyhedra and Efficiency. Springer, Heidelberg (2003)
Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: Proceedings of the 39th ACM STOC, pp. 661–670 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Király, T., Lau, L.C., Singh, M. (2008). Degree Bounded Matroids and Submodular Flows. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2008. Lecture Notes in Computer Science, vol 5035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68891-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-68891-4_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68886-0
Online ISBN: 978-3-540-68891-4
eBook Packages: Computer ScienceComputer Science (R0)