4843 search results - page 15 / 969 » The Shortcut Problem - Complexity and Approximation |
ICALP
2005
Springer
14 years 1 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, . . . ,...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
We address the problem of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure predict...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
MOR
2000
13 years 7 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...