409 search results - page 26 / 82 » Polynomial Time Approximation Schemes and Parameterized Comp... |
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
IVC
2000
14 years 9 months ago
2000
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
ESA
2005
Springer
15 years 3 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
153
click to vote
SIAMCOMP
2011
14 years 12 days ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
SSD
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Many new applications involving moving objects require the collection and querying of trajectory data, so efficient indexing methods are needed to support complex spatio...