WG 2004 - PDF Preprint Papers

WG 2004 International Workshop on Graph-Theoretic Concepts in Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed WG-2004 Paper

click to vote

WG
2004
Springer

150views Theoretical Computer Science» more WG 2004»

A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs

14 years 5 months ago

Download eprints.eemcs.utwente.nl

A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...

Tim Nieberg, Johann Hurink, Walter Kern

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	150	A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs	claim
2	146	Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters	claim
3	145	Decremental Clique Problem	claim
4	141	Finding k Disjoint Triangles in an Arbitrary Graph	claim
5	133	Collective Tree Spanners and Routing in AT-free Related Graphs	claim
6	120	Minimal de Bruijn Sequence in a Language with Forbidden Substrings	claim
7	110	Planar Graphs, via Well-Orderly Maps and Trees	claim
8	110	The Computational Complexity of the Minimum Weight Processor Assignment Problem	claim
9	107	Treelike Comparability Graphs: Characterization, Recognition, and Applications	claim
10	106	A Symbolic Approach to the All-Pairs Shortest-Paths Problem	claim
11	102	Coloring a Graph Using Split Decomposition	claim
12	101	Crossing Reduction in Circular Layouts	claim
13	101	Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size	claim
14	93	Core Stability of Minimum Coloring Games	claim
15	90	Recognizing HHD-free and Welsh-Powell Opposition Graphs	claim
16	89	Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs	claim
17	85	The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small	claim
18	84	Octagonal Drawings of Plane Graphs with Prescribed Face Areas	claim
19	79	On the Maximum Cardinality Search Lower Bound for Treewidth	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers