Skip to main content
SpringerLink
Log in

Submodular Function Minimization with Submodular Set Covering Constraints and Precedence Constraints

  • Conference paper
  • First Online:
Approximation and Online Algorithms (WAOA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10787))

Included in the following conference series:

  • 713 Accesses

Abstract

In this paper, we consider the submodular function minimization problem with submodular set covering constraints and precedence constraints, and we prove that the algorithm of McCormick, Peis, Verschae, and Wierz for the precedence constrained covering problem can be generalized to our setting.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169–197 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  2. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1988). https://doi.org/10.1007/978-3-642-78240-4

    Book  MATH  Google Scholar 

  3. Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48(4), 761–777 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  4. Schrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Comb. Theory Ser. B 80(2), 346–355 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  5. Goel, G., Karande, C., Tripathi, P., Wang, L.: Approximability of combinatorial problems with multi-agent submodular cost functions. In: Proceedings of the 50th Annual Symposium on Foundations of Computer Science, pp. 755–764 (2009)

    Google Scholar 

  6. Hochbaum, D.S.: Submodular problems - approximations and algorithms. Technical report arXiv:1010.1945 (2010)

  7. Iwata, S., Nagano, K.: Submodular function minimization under covering constraints. In: Proceedings of the 50th Annual Symposium on Foundations of Computer Science, pp. 671–680 (2009)

    Google Scholar 

  8. Iyer, R.K., Bilmes, J.A.: Submodular optimization with submodular cover and submodular knapsack constraints. In: Advances in Neural Information Processing Systems 26, pp. 2436–2444 (2013)

    Google Scholar 

  9. Iyer, R.K., Jegelka, S., Bilmes, J.A.: Curvature and optimal algorithms for learning and minimizing submodular functions. In: Advances in Neural Information Processing Systems 26, pp. 2742–2750 (2013)

    Google Scholar 

  10. Iyer, R.K., Jegelka, S., Bilmes, J.A.: Monotone closure of relaxed constraints in submodular optimization: connections between minimization and maximization. In: Proceedings of the 30th Conference on Uncertainty in Artificial Intelligence, pp. 360–369 (2014)

    Google Scholar 

  11. Jegelka, S., Bilmes, J.A.: Graph cuts with interacting edge weights: examples, approximations, and algorithms. Math. Program. 162, 241–282 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kamiyama, N.: Submodular function minimization under a submodular set covering constraint. In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol. 6648, pp. 133–141. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20877-5_14

    Chapter  Google Scholar 

  13. Koufogiannakis, C., Young, N.E.: Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost. Algorithmica 66(1), 113–152 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  14. Svitkina, Z., Fleischer, L.: Submodular approximation: sampling-based algorithms and lower bounds. SIAM J. Comput. 40(6), 1715–1737 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  15. Zhang, H., Vorobeychik, Y.: Submodular optimization with routing constraints. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence, pp. 819–826 (2016)

    Google Scholar 

  16. Kamiyama, N.: A note on submodular function minimization with covering type linear constraints. Algorithmica (to appear)

    Google Scholar 

  17. McCormick, S.T., Peis, B., Verschae, J., Wierz, A.: Primal–dual algorithms for precedence constrained covering problems. Algorithmica 78, 771–787 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  18. Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2(4), 385–393 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  19. Fujito, T.: On approximation of the submodular set cover problem. Oper. Res. Lett. 25(4), 169–174 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  20. Fujito, T., Yabuta, T.: Submodular integer cover and its application to production planning. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol. 3351, pp. 154–166. Springer, Heidelberg (2005). https://doi.org/10.1007/978-3-540-31833-0_14

    Chapter  Google Scholar 

  21. Fujito, T.: Approximating bounded degree deletion via matroid matching. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 234–246. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-57586-5_20

    Chapter  Google Scholar 

  22. Lovász, L.: Submodular functions and convexity. In: Bachem, A., Korte, B., Grötschel, M. (eds.) Mathematical Programming–The State of the Art, pp. 235–257. Springer, Heidelberg (1983). https://doi.org/10.1007/978-3-642-68874-4_10

    Chapter  Google Scholar 

  23. Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Guy, R., Hanani, H., Sauer, N., Schönheim, J. (eds.) Combinatorial Structures and their Applications, pp. 69–87. Gordon and Breach (1970)

    Google Scholar 

  24. Nagano, K.: A faster parametric submodular function minimization algorithm and applications. Technical report METR 2007-43. The University of Tokyo (2007)

    Google Scholar 

  25. Murota, K.: Discrete convex analysis. SIAM Monographs on Discrete Mathematics and Applications, vol. 10. Society for Industrial and Applied Mathematics (2003)

    Google Scholar 

Download references

Acknowledgements

This research was supported by JST PRESTO Grant Number JPMJPR14E1, Japan.

Author information

Authors and Affiliations

  1. Institute of Mathematics for Industry, Kyushu University, Fukuoka, Japan

    Naoyuki Kamiyama

  2. JST, PRESTO, Saitama, Japan

    Naoyuki Kamiyama

Authors
  1. Naoyuki Kamiyama
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Naoyuki Kamiyama .

Editor information

Editors and Affiliations

  1. The University of Western Ontario, London, Ontario, Canada

    Roberto Solis-Oba

  2. German University of Technology in Oman, Muscat, Oman

    Rudolf Fleischer

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kamiyama, N. (2018). Submodular Function Minimization with Submodular Set Covering Constraints and Precedence Constraints. In: Solis-Oba, R., Fleischer, R. (eds) Approximation and Online Algorithms. WAOA 2017. Lecture Notes in Computer Science(), vol 10787. Springer, Cham. https://doi.org/10.1007/978-3-319-89441-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-89441-6_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-89440-9

  • Online ISBN: 978-3-319-89441-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation