681 search results - page 32 / 137 » General Polynomial Time Decomposition Algorithms |
115
Voted
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
104
Voted
ESA
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
116
Voted
WADS
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
105
click to vote
AMAI
1999
Springer
15 years 7 days ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
118
Voted
SODA
1997
ACM
15 years 1 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...