186 search results - page 8 / 38 » Improved approximation algorithms for directed Steiner fores... |
STOC
2007
ACM
15 years 10 months ago
2007
ACM
EOR
2008
14 years 9 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
112
click to vote
ESA
2003
Springer
15 years 2 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an Ç´ÔÒµapproximation. This improves on the previous approximation guarantee of Ã...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...