B. Raghavachari and J. Veerasamy. Approximation algorithms for the asymmetric postman problem. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A 3/2-approximation algorithm for the Windy Postman Problem - Raghavachari, Veerasamy (2001) Self-citation (Raghavachari Veerasamy) (Correct)
....is mixed, i.e. if it contains both undirected and directed edges, CPP was shown to be NP hard by Papadimitriou [12] The Mixed Postman Problem (MPP) is a generalization of CPP, and it enables us to model one way and two way streets. A preliminary version of the paper appeared in SODA 1999 [15] y Department of Computer Science, The University of Texas at Dallas, Richardson, TX 75083 0688. Research supported by the National Science Foundation under grants CCR 9409625 and CCR 9820902. Email: rbk utdallas.edu. z Department of Computer Science, The University of Texas at Dallas, and ....
B. Raghavachari and J. Veerasamy. Approximation algorithms for the asymmetric postman problem. In Proceedings of 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 734-741, 1999.
Postman Problems on Mixed Graphs - Mart (2003) (Correct)
No context found.
B. Raghavachari and J. Veerasamy. Approximation algorithms for the asymmetric postman problem. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 1999.
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