3875 search results - page 40 / 775 » Approximation Algorithms for the Max-coloring Problem |
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of finding a lowest cost dominating set in a given disk graph containing n disks. The problem has been extensively studied on subclasses of disk graphs, ye...
147
Voted
ALGORITHMICA
1998
15 years 2 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
121
Voted
CCCG
2010
15 years 3 months ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
146
click to vote
WDAG
2009
Springer
15 years 9 months ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
101
click to vote
AAIM
2010
Springer
15 years 5 months ago
2010
Springer
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...