2343 search results - page 86 / 469 » The Locomotive Routing Problem |
HM
2007
Springer
14 years 4 months ago
2007
Springer
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...
WIOPT
2006
IEEE
14 years 4 months ago
2006
IEEE
Abstract— The inherent nature of the physical setup and transmission mechanism in wireless ad hoc networks with random channel access, results in correlation between the link met...
FOCS
2005
IEEE
14 years 3 months ago
2005
IEEE
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...
RANDOM
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blo...
ISCAS
2002
IEEE
14 years 3 months ago
2002
IEEE
We address the problem of checking the routability of segmented channels using satisfiability. The segmented channel routing problem arises in the context of row-based field progr...