13987 search results - page 243 / 2798 » The Two Guards Problem |
132
Voted
IPCO
1998
15 years 5 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
138
click to vote
ALGORITHMICA
2007
15 years 4 months ago
2007
A 0-1 matrix has the Consecutive Ones Property (C1P) if there is a permutation of its columns that leaves the 1’s consecutive in each row. The Consecutive Ones Submatrix (C1S) p...
146
click to vote
DISOPT
2010
15 years 4 months ago
2010
In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several cu...
123
click to vote
AAECC
2006
Springer
15 years 4 months ago
2006
Springer
The conjugacy search problem in a group G is the problem of recovering an x G from given g G and h = x-1 gx. This problem is in the core of several recently suggested public key ...
158
Voted
NETWORKS
2008
15 years 4 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...