2698 search results - page 94 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
173
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
131
click to vote
ECIR
2004
Springer
15 years 7 months ago
2004
Springer
This paper introduces a new approach to add fault-tolerance to a fulltext retrieval system. The weighted pattern morphing technique circumvents some of the disadvantages of the wid...
219
click to vote
IFIPTCS
2010
15 years 4 months ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
178
click to vote
ISAAC
2009
Springer
16 years 25 days ago
2009
Springer
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
171
click to vote
MP
1998
15 years 6 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...