455 search results - page 9 / 91 » Approximation Algorithms for Partial Covering Problems |
MP
1998
14 years 9 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...
88
Voted
DAM
2006
14 years 9 months ago
2006
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
AAIM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
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 ...
91
Voted
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...