4843 search results - page 116 / 969 » The Shortcut Problem - Complexity and Approximation |
98
Voted
SODA
1997
ACM
14 years 11 months ago
1997
ACM
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
IPL
2006
14 years 10 months ago
2006
We study the NP-hard problem of labeling points with maximum-radius circle pairs: given n point sites in the plane, find a placement for 2n interior-disjoint uniform circles, such...
SIAMCOMP
2010
14 years 4 months ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
SIAMCOMP
2010
14 years 4 months ago
2010
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...