Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs
 
conference paper

Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs

Moldenhauer, Carsten  
2011
Proceedings of Automata, Languages and Programming - 38th International Colloquium
Automata, Languages and Programming - 38th International Colloquium
  • Details
  • Metrics
Type
conference paper
DOI
10.1007/978-3-642-22006-7_63
Author(s)
Moldenhauer, Carsten  
Date Issued

2011

Publisher

Springer

Published in
Proceedings of Automata, Languages and Programming - 38th International Colloquium
ISBN of the book

978-3-642-22005-0

Start page

748

End page

759

Editorial or Peer reviewed

REVIEWED

Written at

OTHER

EPFL units
DISOPT  
Event nameEvent placeEvent date
Automata, Languages and Programming - 38th International Colloquium

Zürich, Switzerland

July 4-8, 2011

Available on Infoscience
November 10, 2011
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/72407
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés