Approximations of independent sets in graphs

Approximations of independent sets in graphs

Cached

Download Links

[www.raunvis.hi.is]

by Magnus M. Halldorsson

Citations:

9 - 1 self

BibTeX

@MISC{Halldorsson_approximationsof,
    author = {Magnus M. Halldorsson},
    title = { Approximations of independent sets in graphs},
    year = {}
}

Bookmark

OpenURL

Abstract

Citations

577	Approximation algorithms for combinatorial problems - Johnson - 1974
260	Approximation algorithms for NP-complete problems on planar graphs - Baker - 1994
154	Approximate graph coloring by semidefinite programming - Karger, Motwani, et al. - 1994
122	Approximating maximum independent sets by excluding subgraphs - Boppana, Halldorsson - 1992
102	Vertex packings: Structural properties and algorithms - Nemhauser, Trotter - 1975
98	On syntactic versus computational views of approximability - Khanna, Motwani, et al. - 1994
65	A still better performance guarantee for approximate graph coloring - Halld'orsson - 1993
63	On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems - Hurkens, Schrijver - 1989
62	Derandomized graph products - Alon, Feige, et al. - 1995
45	Greed is good: Approximating independent sets in sparse and bounded-degree graphs - Halldórsson, Radhakrishnan - 1997
37	Randomized graph products, chromatic numbers, and the Lov'asz #-function - Feige - 1995
36	Derandomizing semidefinite programming based approximation algorithms - Mahajan, Ramesh - 1995
33	Approximating the independence number via the `-function - Alon, Kahale - 1994
32	Approximating discrete collections via local improvements - Halldórsson - 1995
27	On the approximation properties of independent set problem in degree 3 graphs - Berman, Fujito - 1995
27	Approximating Maximum Independent Set in Bounded Degree Graphs - Berman, Furer - 1994
26	Clique is hard to approximate within n1\Gamma ffl - Hastad - 1996
21	Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and coloring - Halldórsson, Lau - 1997
19	Nonoverlapping local alignments (weighted independent sets of axisparallel rectangles - Bafna, Narayanan, et al. - 1996
14	Improved approximations of independent sets in bound-degree graphs - Halldorsson, Radhakrishnan - 1994
13	Independent sets with domination constraints - Halldórsson, Kratochvíl, et al. - 1999
11	On approximation problems related to the independent set and vertex cover problems - Bar-Yehuda, Moran
8	On Turán’s theorem for sparse graphs - Ajtai, Erdős, et al. - 1981
6	Some remarks on chromatic graphs - Erdos - 1967
4	The Complexity of Boolean Functions - Boppana, Sipser - 1990
4	Local optimality and its application on independent sets for k-claw free graphs - Yu, Goldschmidt - 1997
3	On local search for weighted k-set packing. ESA-97 - Arkin, Hassin - 1997
2	Improved approximations for maximum independent set via approximation chains - Demange, Paschos - 1996
1	Approximating weighted k-set-packing - Chandra, Halld'orsson - 1998
1	Approximation via partitioning. Res. Report IS-RR-95-0003F, Japan Adv - Halld'orsson - 1995
1	Applications of a planar separator theorem. FOCS '77 - Lipton, Tarjan - 1966
1	41] A. Wigderson. Improving the performance guarantee for approximate graph coloring - Vishwanathan - 1996
1	On locally optimal independent sets and vertex covers - Yu, Goldschmidt - 1993