Disjoint-path facility location: Theory and practice

2011 Proceedings of the 13th Workshop on Algorithm Engineering and Experiments, ALENEX 2011

Volumn , Issue , 2011, Pages 60-74

  Breslau, Lee ^a   Diakonikolas, Ilias ^b   Duffield, Nick ^a   Gu, Yu ^c   Hajiaghayi, Mohammadtaghi ^a   Johnson, David S ^a   Karloff, Howard ^a   Resende, Mauricio G C ^a   Sen, Subhabrata ^a  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c AMAZON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COST EFFECTIVENESS; DIRECTED GRAPHS; FACILITIES; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; SALES;

COST-EFFECTIVE APPROACH; FACILITY LOCATION PROBLEM; FACILITY LOCATIONS; MONITORING APPLICATIONS; NP-COMPLETE LANGUAGE; QUASI-POLYNOMIAL TIME; SYNTHETIC NETWORKS; THEORY AND PRACTICE;

LOCATION;

EID: 84880373543     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972917.7     Document Type: Conference Paper

References (12)

1. J. Bean. Genetics and random keys for sequencing and optimization. ORSA Journal on Computing, 6:154160, 1994.
2. L. Breslau, C. Chase, N. Duffield, B. Fenner, Y. Mao, and S. Sen. Vmscope a virtual multicast VPN performance monitor. ACM SIGCOMM Workshop on Internet Network Management (INM), 2006.
3. L. Breslau, I. Diakonikolas, N. Duffield, Y. Gu, M. Hajiaghayi, D. S. Johnson, H. Karloff, M. G. C. Resende, and S. Sen. Disjoint-path facility location: Theory and practice, 2010. Preliminary draft of journal version, available at http://www.research.att.com/-dsj/papers/fullmonitor.pdf.
4. H. Burch and C. Chase. Monitoring link delays with one measurement host. SIGMETRICS Performance Evaluation Review, 33(3):10-17, 2005.
5. L. Buriol, M. Resende, and M. Thorup. Survivable IP network design with OSPF routing. Networks, 49(1):51-64, 2007.
6. K. Calvert, M. Doar, and E. Zegura. Modeling Internet Topology. IEEE Communications Magazine, 35(6), 1997.
7. J. F. Goņcalves and M. G. Resende. Biased randomkey genetic algorithms for combinatorial optimization. Journal of Heuristics, 2010. Published online 27 August 2010. DOI: 10.1007/s10732-010-9143-1.
8. Y. Gu, L. Breslau, N. Duffield, and S. Sen. GRE encapsulated multicast probing: A scalable technique for measuring one-way loss. In IEEE Infocom 2008: The 27th Conf. on Comput. Comm., pages 1651-1659. IEEE Communications Society, New York, NY, 2008. A slightly earlier version of this paper is available at http://www.research.att.com/-duffield/papers/GBDS-vmscope.pdf.
9. R. Hassin and D. Segev. The set cover with pairs problem. In FSTTCS 2005: Proceedings of the 25th International Conference on Foundations of Software Technology and Theoretical Computer Science, volume 3821 of Lecture Notes in Computer Science, pages 164176, Berlin, 2005. Springer-Verlag.
10. D. S. Johnson. Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci., 9:256-278, 1974.
11. G. Kortsarz. On the hardness of approximating spanners. Algorithmica, 30:432-450, 2001.
12. L. Lovász. On the ratio of optimal integral and fractional covers. Disc. Math., 13:383-390, 1975.