Title of article :
APPROXIMATING CAPACITATED ROUTING AND DELIVERY PROBLEMS
Author/Authors :
MOTWANI، RAJEEV نويسنده , , CHALASANI، PRASAD نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 1999
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 :
capacitated vehicle routing , capacitated delivery , maximum latency problem , matroid intersection , Approximation algorithms , traveling salesperson problem , NP-hard
Journal title :
SIAM Journal on Computing
Journal title :
SIAM Journal on Computing
