12519 search results - page 190 / 2504 » Approximation Problems Categories |
194
click to vote
SODA
1997
ACM
15 years 7 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...
163
click to vote
CC
2006
Springer
15 years 6 months ago
2006
Springer
Given a k-uniform hypergraph, the Maximum k-Set Packing problem is to find the maximum disjoint set of edges. We prove that this problem cannot be efficiently approximated to with...
154
click to vote
IPL
2006
15 years 6 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...
158
click to vote
SIAMCOMP
2010
15 years 1 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...
155
click to vote
ICRA
2007
IEEE
16 years 23 days ago
2007
IEEE
Abstract— The problem of an effective coordination of multiple autonomous robots is one of the most important tasks of the modern robotics. In turn, it is well known that the lea...