4843 search results - page 22 / 969 » The Shortcut Problem - Complexity and Approximation |
CCCG
2007
13 years 10 months ago
2007
Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rec...
OL
2008
13 years 8 months ago
2008
Building on an existing 2-approximate algorithm for the class of network design problems with downwards-monotone demand functions, many of which are NP-hard, we present an algorith...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
In this paper we consider both the maximization variant Max Rep and the minimization variant Min Rep of the famous Label Cover problem, for which, till now, the best approximation ...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
DAGSTUHL
2004
13 years 10 months ago
2004
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...