226 search results - page 9 / 46 » Approximation algorithm for the kinetic robust K-center prob... |
143
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
176
click to vote
IPCO
2007
15 years 7 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
158
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
180
click to vote
ICDAR
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper introduces a framework for clarifying and formalizing the duplicate document detection problem. Four distinct models are presented, each with a corresponding algorithm ...
151
click to vote
CCR
2006
15 years 5 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...