4843 search results - page 84 / 969 » The Shortcut Problem - Complexity and Approximation |
108
click to vote
ICTCS
2001
Springer
15 years 2 months ago
2001
Springer
In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing t...
QEST
2006
IEEE
15 years 4 months ago
2006
IEEE
We give a quick overview of some key issues in (quantitative) call center management: building realistic models, developing efficient tools to simulate these models, finding qui...
JSCIC
2007
14 years 9 months ago
2007
We consider a discontinuous Galerkin finite element method for the advection–reaction equation in two space–dimensions. For polynomial approximation spaces of degree greater t...
108
click to vote
FOCS
2008
IEEE
14 years 11 months ago
2008
IEEE
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
ESA
2005
Springer
15 years 3 months ago
2005
Springer
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...