Improved Approximations of Independent Sets in Bounded-Degree Graphs

Authors:
Magnús M. Halldórsson;Jaikumar Radhakrishnan
Affiliations:
-;-
Venue:
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
Year:
1994

Citing 0
Cited 3

Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Improved approximations of independent sets in bounded-degree graphs via subgraph removal

Nordic Journal of Computing
A survey of approximation results for local search algorithms

Efficient Approximation and Online Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract