Advertisement

Algorithmica

, Volume 81, Issue 3, pp 1126–1151 | Cite as

The Minimum Feasible Tileset Problem

  • Yann Disser
  • Stefan Kratsch
  • Manuel SorgeEmail author
Article
  • 52 Downloads

Abstract

We introduce and study the Minimum Feasible Tileset problem: given a set of symbols and subsets of these symbols (scenarios), find a smallest possible number of pairs of symbols (tiles) such that each scenario can be formed by selecting at most one symbol from each tile. We show that this problem is \(\mathsf {APX}\)-hard and that it is \(\mathsf {NP}\)-hard even if each scenario contains at most three symbols. Our main result is a 4/3-approximation algorithm for the general case. In addition, we show that the Minimum Feasible Tileset problem is fixed-parameter tractable both when parameterized with the number of scenarios and with the number of symbols.

Keywords

Set packing Approximation algorithm APX hardness Parameterized complexity Minimum feasible tileset 

References

  1. 1.
    Bansal, N., Caprara, A., Sviridenko, M.: A new approximation method for set covering problems, with applications to multidimensional bin packing. SIAM J. Comput. 39(4), 1256–1278 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Bezzo, N., Cortez, R.A., Fierro, R.: Exploiting heterogeneity in robotic networks. In: Redundancy in Robot Manipulators and Multi-Robot Systems. Lecture Notes in Electrical Engineering, vol. 57, pp. 53–75. Springer, Berlin, Heidelberg (2013).  https://doi.org/10.1007/978-3-642-33971-4_4 CrossRefGoogle Scholar
  3. 3.
    Biedl, T., Chan, T., Ganjali, Y., Hajiaghayi, M., Wood, D.: Balanced vertex-orderings of graphs. Discrete Appl. Math. 148(1), 27–48 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Buchin, K., van Kreveld, M.J., Meijer, H., Speckmann, B., Verbeek, K.: On planar supports for hypergraphs. J. Graph Algorithms Appl. 15(4), 533–549 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Chen, J., Komusiewicz, C., Niedermeier, R., Sorge, M., Suchý, O., Weller, M.: Polynomial-time data reduction for the subset interconnection design problem. SIAM J. Discrete Math. 29(1), 1–25 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Crescenzi, P.: A short guide to approximation preserving reductions. In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity (CCC)Google Scholar
  7. 7.
    Cygan., M.: Improved approximation for 3-dimensional matching via bounded pathwidth local search. In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 509–518 (2013)Google Scholar
  8. 8.
    Dell, H., Marx, D.: Kernelization of packing problems. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 68–81 (2012)Google Scholar
  9. 9.
    Dell, H., van Melkebeek, D.: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. J. ACM 61(4), 23:1–23:27 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Disser, Y., Kratsch, S., Sorge, M.: The minimum feasible tileset problem. In: Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA ’14), LNCS, vol. 8952, pp. 144–155. Springer, Heidelberg (2014)Google Scholar
  11. 11.
    Disser, Y., Matuschke, J.: Degree-constrained orientations of embedded graphs. J. Comb. Optim. 31(2), 758–773 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Du, D.-Z., Miller, Z.: Matroids and subset interconnection design. SIAM J. Discrete Math. 1(4), 416–424 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)zbMATHGoogle Scholar
  14. 14.
    Frank, A., Gyárfás, A.: How to orient the edges of a graph. Coll. Math. Soc. Janos Bolyai 18, 353–364 (1976)MathSciNetGoogle Scholar
  15. 15.
    Frank, A., Tardos, É.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica 7(1), 49–65 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H Freeman and Company, San Francisco (1979)zbMATHGoogle Scholar
  17. 17.
    Gottlob, G., Greco, G.: Decomposing combinatorial auctions and set packing problems. J. ACM 60(4), 24 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Hakimi, S.: On the degrees of the vertices of a directed graph. J. Frankl. Inst. 279(4), 290–308 (1965)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Johnson, D.S., Pollak, H.O.: Hypergraph planarity and the complexity of drawing Venn diagrams. J. Graph Theory 11(3), 309–325 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Kann, V.: Maximum bounded 3-dimensional matching is MAX SNP-complete. Inf. Process. Lett. 37(1), 27–35 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Kannan, R.: Minkowski’s convex body theorem and integer programming. Math. Oper. Res. 12, 415–440 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Koutis, I.: Faster algebraic algorithms for path and packing problems. In: Proceedings of the 35th International Colloquium on Automata (ICALP), pp. 575–586 (2008)Google Scholar
  23. 23.
    Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538–548 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Lundh, R., Karlsson, L., Saffiotti, A.: Autonomous functional configuration of a network robot system. Robot. Auton. Syst. 56(10), 819–830 (2008)CrossRefGoogle Scholar
  25. 25.
    Marek, C., Fomin, F.V., Kowalik, Ł., Lokshtanov, D., Marx, D., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Berlin (2015)zbMATHGoogle Scholar
  26. 26.
    Mittal, S.: A survey of techniques for architecting and managing asymmetric multicore processors. ACM Comput. Surv. 48(3), 1–38 (2016)CrossRefGoogle Scholar
  27. 27.
    Reinhard, D.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 5th edn. Springer, Berlin (2016)Google Scholar
  28. 28.
    Rodney, G., Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, Berlin (2013)zbMATHGoogle Scholar
  29. 29.
    Schuurman, P., Woeginger, G.J.: Approximation schemes—a tutorial. http://www.win.tue.nl/~gwoegi/papers/ptas.pdf
  30. 30.
    Sviridenko, M., Ward, J.: Large neighborhood local search for the maximum set packing problem. In: 40th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 792–803 (2013)Google Scholar
  31. 31.
    van Bevern, R., Kanj, I., Komusiewicz, C., Niedermeier, R., Sorge,M.: Twins in subdivision drawings of hypergraphs. In: Proceedings of the 24th International Symposium on Graph Drawing & Network Visualization, LNCS, vol. 9801, pp. 67–80. Springer, Heidelberg (2016)Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Institut für Mathematik, Graduate School CETU DarmstadtDarmstadtGermany
  2. 2.Institut für InformatikHumboldt-Universität zu BerlinBerlinGermany
  3. 3.Institut für Softwaretechnik und Theoretische InformatikTU BerlinBerlinGermany
  4. 4.Department of Industrial Engineering and ManagementBen Gurion University of the NegevBeer ShevaIsrael

Personalised recommendations