Structural rounding: Approximation algorithms for graphs near an algorithmically tractable class
Name
LIPIcs-ESA-2019-37.pdf
Description
Published version
Size
591.62 KB
Format
Adobe PDF
Checksum (MD5)
e95b7cf179e802e868b338876cc8b6bf
Author(s)
Demaine, Erik D
Liu, Quanquan C.
Vakilian, Ali
Date Issued
September 2019
Journal
Leibniz International Proceedings in Informatics, LIPIcs
Citation
Demaine, Erik D. et al. “Structural rounding: Approximation algorithms for graphs near an algorithmically tractable class.” Leibniz International Proceedings in Informatics, LIPIcs, 144, 37 (September 2019): 1-15 © 2019 The Author(s)
Version
Final published version
Abstract
We develop a framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world networks) while still guaranteeing approximation ratios. The idea is to edit a given graph via vertex- or edge-deletions to put the graph into an algorithmically tractable class, apply known approximation algorithms for that class, and then lift the solution to apply to the original graph. We give a general characterization of when an optimization problem is amenable to this approach, and show that it includes many well-studied graph problems, such as INDEPENDENT SET, VERTEX COVER, FEEDBACK VERTEX SET, MINIMUM MAXIMAL MATCHING, CHROMATIC NUMBER, (ℓ-)DOMINATING SET, EDGE (ℓ-)DOMINATING SET, and CONNECTED DOMINATING SET. To enable this framework, we develop new editing algorithms that find the approximately-fewest edits required to bring a given graph into one of a few important graph classes (in some cases these are bicriteria algorithms which simultaneously approximate both the number of editing operations and the target parameter of the family). For bounded degeneracy, we obtain an O(r log n)approximation and a bicriteria (4, 4)-approximation which also extends to a smoother bicriteria trade-off. For bounded treewidth, we obtain a bicriteria (O(log1.5 n), O(√log w))-approximation, and for bounded pathwidth, we obtain a bicriteria (O(log1.5 n), O(√log w · log n))-approximation. For treedepth 2 (related to bounded expansion), we obtain a 4-approximation. We also prove complementary hardness-of-approximation results assuming P ≠ NP: in particular, these problems are all log-factor inapproximable, except the last which is not approximable below some constant factor 2 (assuming UGC).
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution 3.0 unported license
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.4230/LIPIcs.ESA.2019.37
