On network design problems: Fixed cost flows and the covering Steiner problem

Wolfgang Slany, Guy Even, Guy Kortsarz

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Original languageEnglish
Title of host publicationAlgorithm theory
EditorsMartti Penttonen, Erik Meineche Schmidt
Place of PublicationBerlin [u.a.]
PublisherSpringer
Pages318-329
Volume2368
ISBN (Print)3-540-43866-1
Publication statusPublished - 2002
EventScandinavian Workshop on Algorithm Theory - Turku, Finland
Duration: 3 Jul 20025 Jul 2002

Publication series

NameLecture Notes in Computer Science
PublisherSpringer

Conference

ConferenceScandinavian Workshop on Algorithm Theory
CountryFinland
CityTurku
Period3/07/025/07/02

Treatment code (Nähere Zuordnung)

  • Application
  • Theoretical
  • Experimental

Cite this

Slany, W., Even, G., & Kortsarz, G. (2002). On network design problems: Fixed cost flows and the covering Steiner problem. In M. Penttonen, & E. M. Schmidt (Eds.), Algorithm theory (Vol. 2368, pp. 318-329). (Lecture Notes in Computer Science). Berlin [u.a.]: Springer.