Search Sciweavers | Sciweavers

2283 search results - page 47 / 457

» Bounds of Graph Characteristics

click to vote

COCO
2009
Springer

128views Algorithms» more COCO 2009»

Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

14 years 2 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 »

click to vote

FOCS
2006
IEEE

123views Theoretical Computer Science» more FOCS 2006»

Lower Bounds for Additive Spanners, Emulators, and More

14 years 1 months ago

Download itcs.tsinghua.edu.cn

An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...

David P. Woodruff

claim paper

Read More »

click to vote

WINE
2009
Springer

83views Economy» more WINE 2009»

The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs

14 years 2 months ago