, Improved results for service constrained network design problems, Network Design: Connectivity and Facilities Location (P. M. Pardalos and D. Du, eds.), AMS-DIMACS Volume Series in Discrete Mathematics and Theoretical Computer Science, vol. 40, American Mathematical Society, 1998, pp. 269--276.  Home/Search   Document Not in Database   Summary   Related Articles

....algorithm from [20] we get a (1 ; 2(1 1= O(log 3 m log log m) approximation for BCCMED. Our algorithm given in Section 6 uses the techniques from [20] directly and improves this result. 3.2. Related Work. Other service constrained minimum cost network problems have been considered in [1, 6, 12, 16, 17]. These papers consider the variant that prescribes a budget on the service distance for each node not in the tree. The goal is to find a minimum length salesperson tour (or a tree as may be the case) so that all the (customer) nodes are strictly serviced. Restrictions of the problems to geometric ....

, Improved results for service constrained network design problems, Network Design: Connectivity and Facilities Location (P. M. Pardalos and D. Du, eds.), AMS-DIMACS Volume Series in Discrete Mathematics and Theoretical Computer Science, vol. 40, American Mathematical Society, 1998, pp. 269--276.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC