Elimination graphs
Citations
81 citations
59 citations
Cites methods from "Elimination graphs"
...The inductive independence number has been used before in [Akcoglu et al. 2002; Ye and Borodin 2012] to approximate independent sets within a factor of ρ with a motivation stemming from chordal graphs....
[...]
56 citations
48 citations
42 citations
Cites background or methods or result from "Elimination graphs"
...Clearly, as already mentioned in the paper of Ye and Borodin [40], each k-simplicial graph is also sequentially k-independent, whereas the reverse needs not to be true....
[...]
...The k-perfectly groupable graphs are exactly the graphs Ĝ[V CCk] in [40], but they are not studied in detail and no approximation results for these graphs are represented....
[...]
...As already known in literature and mentioned in [40], for a disk D there are at most 5 pairwise non-intersecting disks of at least the same radius that intersect D....
[...]
...To compare our results with the results of Ye and Borodin in [40] it may be useful to provide bounds also for the parameters considered in their paper....
[...]
...For the size of a maximum independent set this—as mentioned in the previous sections—was done by Ye and Borodin [40]....
[...]
References
2,170 citations
"Elimination graphs" refers background in this paper
...Since a weighted maximum independent set in a bipartite graph can be determined in polynomial time [de Figueiredo and Maffray 2004; Gr¨ otschel et al. 1981], the weighted maximum clique in Gi can be computed in polynomial time....
[...]
1,917 citations
"Elimination graphs" refers methods in this paper
...Edmonds’s weighted matching algorithm [Edmonds 1965] has been extended to the weighted maximum independent set problem for 3-claw-free graphs [Minty 1980; Nakamura and Tamura 2001]....
[...]
...Edmonds s weighted matching algorithm [Edmonds 1965] has been extended to the weighted maximum independent set problem for 3-claw-free graphs [Minty 1980; Nakamura and Tamura 2001]....
[...]
1,380 citations
1,047 citations
"Elimination graphs" refers background or methods in this paper
...Baker s PTAS algorithm [Baker 1994] for minimum vertex cover on planar graphs depends on a planar embedding and would not be considered as a simple combinatorial algorithm....
[...]
...Baker’s PTAS algorithm [Baker 1994] for minimum vertex cover on planar graphs depends on a planar embedding and would not be considered as a simple combinatorial algorithm....
[...]
...For many NP-complete problems, there exist PTASs when the graph is planar [Baker 1994]....
[...]
...…et al. [2005], the authors consider a more general case of geometric intersection graphs (including disk graphs) and give PTASs for the weighted maximum independent set problem and the weighted minimum vertex cover problem, based on a sophisticated use of the shifting strategy [Baker 1994]....
[...]
...[2005], the authors consider a more general case of geometric intersection graphs (including disk graphs) and give PTASs for the weighted maximum independent set problem and the weighted minimum vertex cover problem, based on a sophisticated use of the shifting strategy [Baker 1994]....
[...]
831 citations
"Elimination graphs" refers background in this paper
...The most notable examples are the matroid [Edmonds 1971] and greedoid [Korte and Lov´ asz 1981] structures in correspondence to greedy algorithms, which have been studied extensively in the literature....
[...]
...The most notable examples are the matroid [Edmonds 1971] and greedoid [Korte and Lovász 1981] structures in correspondence to greedy algorithms, which have been studied extensively in the literature....
[...]