L16 - References [BDT09] Glencora Borradaile, Erik D....

Info iconThis preview shows pages 1–14. Sign up to view the full content.

View Full Document Right Arrow Icon
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 10
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 12
References [BDT09] Glencora Borradaile, Erik D. Demaine, and Siamak Tazari. Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs. In STACS ’09: Proceedings of the 26th Symposium on Theoretical Aspects of Computer Sci- ence , pages 171–182, 2009. [Ber90] Marshall Bern. Faster exact algorithms for Steiner trees in pla- nar networks. Networks , 20:109–120, 1990. [BHKM12] MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Philip Klein, and Claire Mathieu. A polynomial-time approx- imation scheme for planar multiway cut. In SODA ’12: Pro- ceedings of the 23rd annual ACM-SIAM Symposium on Discrete Algorithms , page to appear. ACM, 2012. [BHM10] MohammadHossein Bateni, MohammadTaghi Hajiaghayi, and D´aniel Marx. Approximation schemes for Steiner forest on pla- nar graphs and graphs of bounded treewidth. In STOC ’10: Proceedings of the 42nd annual ACM Symposium on Theory of Computing , pages 211–220. ACM, 2010. [BK08]
Background image of page 13

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 14
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 14

L16 - References [BDT09] Glencora Borradaile, Erik D....

This preview shows document pages 1 - 14. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online