WAOA
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
JCO
2010
13 years 2 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
MOR
2000
13 years 4 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
IPL
2006
13 years 4 months ago
2006
We study the problem of embedding a directed hypergraph on a ring that has applications in optical network communications. The undirected version (MCHEC) has been extensively stud...
ECCC
2006
13 years 4 months ago
2006
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
DAM
2006
13 years 4 months ago
2006
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
SODA
1997
ACM
13 years 5 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...
SODA
2004
ACM
13 years 5 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...
IPCO
2008
13 years 5 months ago
2008
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...