3874 search results - page 201 / 775 » Approximation Algorithms for k-hurdle Problems |
222
Voted
DC
2011
14 years 3 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
132
Voted
ESA
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
144
Voted
ISAAC
2005
Springer
15 years 9 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...
137
Voted
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
129
Voted
DAGSTUHL
2004
15 years 5 months ago
2004
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...