2698 search results - page 204 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
211
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
198
click to vote
SECON
2010
IEEE
15 years 4 months ago
2010
IEEE
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
162
click to vote
RECOMB
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. Genome doubling simultaneously doubles all genetic markers. Genome rearrangement phylogenetics requires that all genomes analyzed have the same set of orthologs, so that ...
193
click to vote
CSCLP
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
163
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...