Degree bounded matroids and submodular flows

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≤|Be|≤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 several 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.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    N. Bansal, R. Khandekar, J. Könemann, V. Nagarajan, B. Peis: On Generalizations of Network Design Problems with Degree Bounds, In Proceedings of the 14th Conference on Integer Programming and Combinatorial Optimization (IPCO) 110–123, 2010.

  2. [2]

    N. Bansal, R. Khandekar and V. Nagarajan: Additive Guarantees for Degree Bounded Directed Network Design, SIAM Journal on Computing 39 (2009), 1413–1431.

    MathSciNet  MATH  Article  Google Scholar 

  3. [3]

    V. Bilo, V. Goyal, R. Ravi and M. Singh: On the Crossing Spanning Tree Problem, Proceedings of 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) 51–60, 2004.

  4. [4]

    K. Chaudhuri, S. Rao, S. Riesenfeld and K. Talwar: A Push-Relabel Algorithm for Approximating the Minimum-Degree MST Problem and its Generalization to Matroids, Theoretical Computer Science, 410, (2009), 4489–4503.

  5. [5]

    W.H. Cunningham: Testing Membership in Matroid Polyhedra, Journal of Combinatorial Theory, Series B, 36, (1984), 161–188.

    MathSciNet  MATH  Article  Google Scholar 

  6. [6]

    J. Edmonds, R. Giles: A Min-Max Relation for Submodular Functions on Graphs, Annals of Discrete Mathematics 1, (1977), 185–204.

    MathSciNet  Article  Google Scholar 

  7. [7]

    A. Frank: An Algorithm for Submodular Functions on Graphs, Annals of Discrete Mathematics 16 (1982), 97–120.

    MATH  Google Scholar 

  8. [8]

    A. Frieze: Personal Communication, March 2007.

  9. [9]

    M. X. Goemans: Minimum Bounded-Degree Spanning Trees, In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 273–282, 2006.

  10. [10]

    K. Jain: A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem, Combinatorica 21 (2001), 39–60.

    MathSciNet  MATH  Article  Google Scholar 

  11. [11]

    T. Király, L.C. Lau: Degree Bounded Forest Covering, In: Proceedings of the 15th International Conference on Integer Programming and Combinaotorial Optimization (IPCO), 315–323, 2011.

  12. [12]

    L.C. Lau, J. Naor, M. Salavatipour and M. Singh: Survivable Network Design with Degree or Order Constraints, In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), 651–660, 2007.

  13. [13]

    A. Schrijver: Combinatorial Optimization, Polyhedra and Efficiency, Springer-Verlag, 2003.

  14. [14]

    M. Singh and L.C. Lau: Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal, In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), 661–670, 2007.

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Tamás Király.

Additional information

A preliminary version of the paper appeared in the Proceedings of the 13th International Conference on Integer Programming and Combinatorial Optimization.

Research supported by grants NFÜ CK80124 from the Hungarian Research and Technology Innovation Fund, and TÁMOP 4.2.1./B-09/KMR-2010-0003.

Research supported by Hong Kong RGC grant 413609.

Research supported by NSERC Discovery grant.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Király, T., Lau, L.C. & Singh, M. Degree bounded matroids and submodular flows. Combinatorica 32, 703–720 (2012). https://doi.org/10.1007/s00493-012-2760-6

Download citation

Mathematics Subject Classification (2000)

  • 68W25
  • 90C27