7129 search results - page 78 / 1426 » Approximation Algorithms for Treewidth |
115
Voted
ASPDAC
2007
ACM
15 years 6 months ago
2007
ACM
The high performance requirements of networking applications has led to the advent of programmable network processor (NP) architectures that incorporate symmetric multiprocessing, ...
142
click to vote
CORR
2007
Springer
15 years 2 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 ...
126
Voted
LATIN
2000
Springer
15 years 6 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...
148
Voted
COCOON
2007
Springer
15 years 8 months 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...
100
Voted
ORL
2007
15 years 2 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. ...