16404 search results - page 645 / 3281 » A set coverage problem |
219
click to vote
ALGORITHMICA
2008
15 years 7 months ago
2008
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion
179
click to vote
IPL
2006
15 years 7 months ago
2006
This paper gives a constructive proof that the register allocation problem for a uniform register set is solvable in polynomial time for SSA-form programs. 2006 Elsevier B.V. All ...
184
click to vote
ICALP
2005
Springer
16 years 21 days ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
191
click to vote
CPAIOR
2004
Springer
16 years 17 days ago
2004
Springer
This paper addresses the question of selecting an algorithm from a predefined set that will have the best performance on a scheduling problem instance. Our goal is to reduce the e...
194
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...