Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class

by   Erik D. Demaine, et al.

We develop a new 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, and Edge (ℓ-)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 several important graph classes (in some cases, also approximating the target parameter of the family). For bounded degeneracy, we obtain a bicriteria (4,4)-approximation which also extends to a smoother bicriteria trade-off. For bounded treewidth, we obtain a bicriteria (O(^1.5 n), O(√( w)))-approximation, and for bounded pathwidth, we obtain a bicriteria (O(^1.5 n), O(√( w)· n))-approximation. For treedepth 2 (also related to bounded expansion), we obtain a 4-approximation. We also prove complementary hardness-of-approximation results assuming P≠NP: in particular, all of the problems just stated have a log-factor inapproximability, except the last which is not approximable below some constant factor (2 assuming UGC).



There are no comments yet.


page 1

page 2

page 3

page 4


Losing Treewidth by Separating Subsets

We study the problem of deleting the smallest set S of vertices (resp.ed...

Experimental evaluation of kernelization algorithms to Dominating Set

The theoretical notions of graph classes with bounded expansion and that...

Greedy domination on biclique-free graphs

The greedy algorithm for approximating dominating sets is a simple metho...

Dominating Sets and Connected Dominating Sets in Dynamic Graphs

In this paper we study the dynamic versions of two basic graph problems:...

Approximation and Heuristic Algorithms for Probabilistic Physical Search on General Graphs

We consider an agent seeking to obtain an item, potentially available at...

Approximating Vertex Cover using Structural Rounding

In this work, we provide the first practical evaluation of the structura...

A performance study of some approximation algorithms for minimum dominating set in a graph

We implement and test the performances of several approximation algorith...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.