666 search results - page 1 / 134 » New primal-dual algorithms for Steiner tree problems |
IPCO
2001
13 years 6 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
WINE
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
HIS
2003
13 years 6 months ago
2003
Abstract. Genetic algorithms (GAs) are a class of search algorithms based on principles of natural evolution. Hence, incorporating mechanisms used in nature may improve the perform...