4843 search results - page 157 / 969 » The Shortcut Problem - Complexity and Approximation |
ICC
2009
IEEE
15 years 10 months ago
2009
IEEE
—In this paper, we study the problem of computing the supported QoS from a source to a destination with multiple additive constraints. The problem has been shown to be NP-complet...
103
click to vote
ISAAC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problem of approximating the average distance between pairs of points in a high-dimensional Euclidean space, and more generally in any metric space. We co...
131
click to vote
STACS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We consider the problem of scheduling jobs on related machines owned by selfish agents and provide the first deterministic mechanisms with constant approximation that a...
114
click to vote
ICDT
2007
ACM
15 years 7 months ago
2007
ACM
Abstract. We introduce approximate data exchange, by relaxing classical data exchange problems such as Consistency and Typechecking to their approximate versions based on Property ...