Sciweavers

2283 search results - page 47 / 457
» Bounds of Graph Characteristics
Sort
View
119
Voted
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
15 years 10 months ago
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
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
139
Voted
FOCS
2006
IEEE
15 years 9 months ago
Lower Bounds for Additive Spanners, Emulators, and More
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
WINE
2009
Springer
83views Economy» more  WINE 2009»
15 years 10 months ago
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs
Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gw...
COCO
2005
Springer
79views Algorithms» more  COCO 2005»
15 years 9 months ago
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy
Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaragh...