598 search results - page 42 / 120 » Approximation Algorithms for the Bottleneck Stretch Factor P... |
WDAG
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
We address a new learning problem where the goal is to build a predictive model that minimizes prediction time (the time taken to make a prediction) subject to a constraint on mod...
COCOON
2004
Springer
14 years 6 days 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...
ISAAC
2003
Springer
14 years 1 months ago
2003
Springer
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...