Search Sciweavers | Sciweavers

2698 search results - page 10 / 540

» Approximation Algorithms for the Weighted Independent Set Pr...

click to vote

WG
2007
Springer

152views Theoretical Computer Science» more WG 2007»

Minimum-Weight Cycle Covers and Their Approximability

14 years 1 months ago

Download wwwhome.math.utwente.nl

A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...

Bodo Manthey

claim paper

Read More »

click to vote

COMPGEOM
2009
ACM

134views Discrete Geometry» more COMPGEOM 2009»

Approximation algorithms for maximum independent set of pseudo-disks

14 years 2 months ago

Download valis.cs.uiuc.edu

Timothy M. Chan, Sariel Har-Peled

claim paper

Read More »

click to vote

SODA
2001
ACM

188views Algorithms» more SODA 2001»

Approximation algorithms for the 0-extension problem

13 years 9 months ago

Download www.cs.technion.ac.il

In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...

Gruia Calinescu, Howard J. Karloff, Yuval Rabani

claim paper

Read More »

click to vote

AAIM
2007
Springer

127views Algorithms» more AAIM 2007»

Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs

14 years 1 months ago

Download www.lab2.kuis.kyoto-u.ac.jp

Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas

claim paper

Read More »