5595 search results - page 316 / 1119 » Approximation Algorithms for Clustering Problems |
167
click to vote
ESA
2007
Springer
16 years 26 days 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...
183
click to vote
ISAAC
2005
Springer
16 years 6 days 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...
182
click to vote
CIAC
2006
Springer
15 years 10 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...
182
click to vote
DAGSTUHL
2004
15 years 8 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...
178
click to vote
SIAMMAX
2010
15 years 1 months ago
2010
Many mathematical models involve flow equations characterized by nonconstant viscosity, and a Stokes type problem with variable viscosity coefficient arises. Appropriate block diag...