4894 search results - page 147 / 979 » The Guarding Problem - Complexity and Approximation |
172
click to vote
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
134
click to vote
MFCS
2005
Springer
15 years 12 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...
159
click to vote
GECCO
2004
Springer
15 years 11 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 ...
197
click to vote
ICALP
2004
Springer
15 years 11 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 ...
193
click to vote
FOCS
1998
IEEE
15 years 10 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...