Search Sciweavers | Sciweavers

330 search results - page 6 / 66

» Compressing Bounded Degree Graphs

139

click to vote

PROPERTYTESTING
2010

152views Theoretical Computer Science» more PROPERTYTESTING 2010»

On Constant Time Approximation of Parameters of Bounded Degree Graphs

14 years 10 months ago

Download www.math.tau.ac.il

How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...

Noga Alon

claim paper

Read More »

click to vote

COCO
2009
Springer

128views Algorithms» more COCO 2009»

Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

15 years 7 months ago

Download www.cims.nyu.edu

We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...

Per Austrin, Subhash Khot, Muli Safra

claim paper

Read More »

Voted

APPROX
2006
Springer

76views Algorithms» more APPROX 2006»

Distance Approximation in Bounded-Degree and General Sparse Graphs

15 years 4 months ago

Download www.eng.tau.ac.il

Sharon Marko, Dana Ron

claim paper

Read More »