A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class
[article]

2018
*
arXiv
*
pre-print

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

arXiv:1806.02771v3
fatcat:p26xojkm2jd3xcrowcx4aoxeyq