2698 search results - page 71 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
98
Voted
CCCG
2007
15 years 4 months ago
2007
We introduce bundle-free triangulations, that are free of large collection of triangles overlapping a circle empty of vertices. We prove that bundle-free Steiner triangulations ca...
132
Voted
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
116
Voted
EUROPAR
2008
Springer
15 years 4 months ago
2008
Springer
We study the problem of scheduling independent tasks on a set of related processors which have a probability of failure governed by an exponential law. We are interested in the bi-...
123
Voted
COCOA
2008
Springer
15 years 4 months ago
2008
Springer
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem i...
119
Voted
DAM
1999
15 years 2 months ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...