4843 search results - page 140 / 969 » The Shortcut Problem - Complexity and Approximation |
MFCS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Given a set of strings S = {s1, . . . , sn}, the Shortest Superstring problem asks for the shortest string s which contains each si as a substring. We consider two measur...
117
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Several inverse problems exist in the atmospheric sciences that are computationally costly when using traditional gradient based methods. Unfortunately, many standard evolutionary ...
152
click to vote
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
149
click to vote
FOCS
1998
IEEE
15 years 7 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
150
click to vote
COCOON
2004
Springer
15 years 6 months ago
2004
Springer
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...