1429 search results - page 75 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
ANTSW
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
AAAI
1998
13 years 10 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
CIMCA
2005
IEEE
14 years 2 months ago
2005
IEEE
We present some proposals to approximately solve a period vehicle routing problem used to model the extraction of oil from a set of onshore oil wells in Brazil. This problem diffe...
CIAC
2006
Springer
14 years 1 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
EOR
2007
13 years 9 months ago
2007
act 11 We address the problem of designing a network built on several layers. This problem occurs in practical applications 12 but has not been studied extensively from the point o...