WG 2005 - PDF Preprint Papers

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

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed WG-2005 Paper

click to vote

WG
2005
Springer

175views Theoretical Computer Science» more WG 2005»

Approximation Algorithms for the Weighted Independent Set Problem

13 years 10 months ago

Download www.ru.is

In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and aver...

Akihisa Kako, Takao Ono, Tomio Hirata, Magnú...

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	175	Approximation Algorithms for the Weighted Independent Set Problem	claim
2	144	Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny	claim
3	136	Algebraic Operations on PQ Trees and Modular Decomposition Trees	claim
4	130	Hypertree Decompositions: Structure, Algorithms, and Applications	claim
5	128	Channel Assignment and Improper Choosability of Graphs	claim
6	123	Induced Subgraphs of Bounded Degree and Bounded Treewidth	claim
7	121	Collective Tree 1-Spanners for Interval Graphs	claim
8	120	Computation of Chromatic Polynomials Using Triangulations and Clique Trees	claim
9	118	Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs	claim
10	97	Approximation Algorithms for Unit Disk Graphs	claim
11	96	Computing the Tutte Polynomial on Graphs of Bounded Clique-Width	claim
12	96	Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time	claim
13	96	Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs	claim
14	94	On Stable Cutsets in Claw-Free Graphs and Planar Graphs	claim
15	93	Extending the Tractability Border for Closest Leaf Powers	claim
16	93	The Computational Complexity of Delay Management	claim
17	91	Approximation Algorithms for the Bi-criteria Weighted max-cut Problem	claim
18	90	Approximating Rank-Width and Clique-Width Quickly	claim
19	86	Locally Consistent Constraint Satisfaction Problems with Binary Constraints	claim
20	82	Recognizing HHDS-Free Graphs	claim
21	79	Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers