433 search results - page 22 / 87 » A greedy approximation algorithm for the group Steiner probl... |
SODA
2003
ACM
13 years 8 months ago
2003
ACM
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...