Title of article
APPROXIMATING CAPACITATED ROUTING AND DELIVERY PROBLEMS
Author/Authors
MOTWANI، RAJEEV نويسنده , , CHALASANI، PRASAD نويسنده ,
Issue Information
دوماهنامه با شماره پیاپی سال 1999
Pages
-2132
From page
2133
To page
0
Abstract
An associative block design is a certain balanced partition of a hypercube into smaller hypercubes. We construct such a design, thus settling the smallest open case.
Keywords
matroid intersection , maximum latency problem , capacitated delivery , traveling salesperson problem , Approximation algorithms , NP-hard , capacitated vehicle routing
Journal title
SIAM Journal on Computing
Serial Year
1999
Journal title
SIAM Journal on Computing
Record number
16638
Link To Document