Document

# Parameterized Orientable Deletion

## File

LIPIcs.SWAT.2018.24.pdf
• Filesize: 0.62 MB
• 13 pages

## Cite As

Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, and Florian Sikora. Parameterized Orientable Deletion. In 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 101, pp. 24:1-24:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.SWAT.2018.24

## Abstract

A graph is d-orientable if its edges can be oriented so that the maximum in-degree of the resulting digraph is at most d. d-orientability is a well-studied concept with close connections to fundamental graph-theoretic notions and applications as a load balancing problem. In this paper we consider the d-Orientable Deletion problem: given a graph G=(V,E), delete the minimum number of vertices to make G d-orientable. We contribute a number of results that improve the state of the art on this problem. Specifically: - We show that the problem is W[2]-hard and log n-inapproximable with respect to k, the number of deleted vertices. This closes the gap in the problem's approximability. - We completely characterize the parameterized complexity of the problem on chordal graphs: it is FPT parameterized by d+k, but W-hard for each of the parameters d,k separately. - We show that, under the SETH, for all d,epsilon, the problem does not admit a (d+2-epsilon)^{tw}, algorithm where tw is the graph's treewidth, resolving as a special case an open problem on the complexity of PseudoForest Deletion. - We show that the problem is W-hard parameterized by the input graph's clique-width. Complementing this, we provide an algorithm running in time d^{O(d * cw)}, showing that the problem is FPT by d+cw, and improving the previously best know algorithm for this case.

## Subject Classification

##### ACM Subject Classification
• Mathematics of computing → Graph algorithms
• Theory of computation → Parameterized complexity and exact algorithms
##### Keywords
• Graph orientations
• FPT algorithms
• Treewidth
• SETH

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono. Upper and lower degree bounded graph orientation with minimum penalty. In CATS'12, volume 128, pages 139-145, 2012.
2. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono. Degree-constrained graph orientation: Maximum satisfaction and minimum violation. Theory Comput. Syst., 58(1):60-93, 2016. URL: http://dx.doi.org/10.1007/s00224-014-9565-5.
3. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, and Kouhei Zenmyo. Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. J. Comb. Optim., 22(1):78-96, 2011.
4. Yuichi Asahiro, Eiji Miyano, and Hirotaka Ono. Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. D.A.M., 159(7):498-508, 2011.
5. Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, and Kouhei Zenmyo. Graph orientation algorithms to minimize the maximum outdegree. Int. J. Found. Comput. Sci., 18(2):197-215, 2007. URL: http://dx.doi.org/10.1142/S0129054107004644.
6. MohammadHossein Bateni, Moses Charikar, and Venkatesan Guruswami. Maxmin allocation via degree lower-bounded arborescences. In STOC, pages 543-552. ACM, 2009.
7. Nadja Betzler, Robert Bredereck, Rolf Niedermeier, and Johannes Uhlmann. On bounded-degree vertex deletion parameterized by treewidth. Discrete Applied Mathematics, 160(1-2):53-60, 2012.
8. Hans L. Bodlaender, Hirotaka Ono, and Yota Otachi. A faster parameterized algorithm for pseudoforest deletion. In IPEC, volume 63, pages 7:1-7:12, 2016.
9. Hans L. Bodlaender, Hirotaka Ono, and Yota Otachi. Degree-constrained orientation of maximum satisfaction: Graph classes and parameterized complexity. Algorithmica, 80(7):2160-2180, 2018. URL: http://dx.doi.org/10.1007/s00453-017-0399-9.
10. Deeparnab Chakrabarty, Julia Chuzhoy, and Sanjeev Khanna. On allocating goods to maximize fairness. In FOCS, pages 107-116. IEEE Computer Society, 2009.
11. Marek Chrobak and David Eppstein. Planar orientations with low out-degree and compaction of adjacency matrices. Theor. Comput. Sci., 86(2):243-266, 1991.
12. Bruno Courcelle and Joost Engelfriet. Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach, volume 138 of Encyclopedia of mathematics and its applications. Cambridge University Press, 2012. URL: http://www.cambridge.org/fr/knowledge/isbn/item5758776/?site_locale=fr_FR.
13. Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015. URL: http://dx.doi.org/10.1007/978-3-319-21275-3.
14. Tomás Ebenlendr, Marek Krcál, and Jirí Sgall. Graph balancing: A special case of scheduling unrelated parallel machines. Algorithmica, 68(1):62-80, 2014. URL: http://dx.doi.org/10.1007/s00453-012-9668-9.
15. Russell Impagliazzo, Ramamohan Paturi, and Francis Zane. Which problems have strongly exponential complexity? J. Comput. Syst. Sci., 63(4):512-530, 2001. URL: http://dx.doi.org/10.1006/jcss.2001.1774.
16. D. Lokshtanov, D. Marx, and S. Saurabh. Known algorithms on graphs on bounded treewidth are probably optimal. In SODA, pages 777-789, 2011.
17. Luke Mathieson. The parameterized complexity of editing graphs for bounded degeneracy. Theor. Comput. Sci., 411(34-36):3181-3187, 2010.
18. Geevarghese Philip, Ashutosh Rai, and Saket Saurabh. Generalized pseudoforest deletion: Algorithms and uniform kernel. In MFCS (2), volume 9235 of LNCS, pages 517-528, 2015.
19. Stefan Szeider. Not so easy problems for tree decomposable graphs. CoRR,abs/1107.1177, 2011.
20. José Verschae and Andreas Wiese. On the configuration-lp for scheduling on unrelated machines. J. Scheduling, 17(4):371-383, 2014. URL: http://dx.doi.org/10.1007/s10951-013-0359-4.
X

Feedback for Dagstuhl Publishing