3874 search results - page 6 / 775 » Approximation Algorithms for k-hurdle Problems |
COR
2006
14 years 9 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
110
click to vote
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
JUCS
2008
14 years 9 months ago
2008
: A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. "Ru...
CIAC
2000
Springer
15 years 1 months ago
2000
Springer
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with ...
106
Voted
MOR
2000
14 years 9 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...