7930 search results - page 150 / 1586 » Greedy in Approximation Algorithms |
192
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
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 ...
180
click to vote
LATIN
2000
Springer
15 years 10 months ago
2000
Springer
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
197
click to vote
COCOON
2007
Springer
16 years 17 days ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
141
click to vote
ORL
2007
15 years 5 months ago
2007
We present a very simple way of derandomizing the algorithm proposed by Gupta, Kumar and Roughgarden for Single Source Rent-or-Buy by using the method of conditional expectation. ...