20 citations · 36 across the 11 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2018
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class
Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster +5
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 sce…
cs.CC2017★ 1 cited
Being even slightly shallow makes life hard
Irene Muzi, Michael P. O'Brien, Felix Reidl +1
We study the computational complexity of identifying dense substructures, namely -shallow topological minors and -subdivisions. Of particular interest is the case when $r=1…