Approximating minimum cost connectivity problems

Research output: Contribution to journal › Conference article › peer-review

Original language	English
Journal	Dagstuhl Seminar Proceedings
Volume	9511
State	Published - 2010
Event	Parameterized Complexity and Approximation Algorithms 2009 - Wadern, Germany Duration: 13 Dec 2009 → 17 Dec 2009

Cite this

@article{d4c81e25db784edfb451e7f160099286,

title = "Approximating minimum cost connectivity problems",

author = "Guy Kortsarz and Zeev Nutov",

year = "2010",

language = "אנגלית",

volume = "9511",

journal = "Dagstuhl Seminar Proceedings",

issn = "1862-4405",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

note = "Parameterized Complexity and Approximation Algorithms 2009 ; Conference date: 13-12-2009 Through 17-12-2009",

}

TY - JOUR

T1 - Approximating minimum cost connectivity problems

AU - Kortsarz, Guy

AU - Nutov, Zeev

PY - 2010

Y1 - 2010

UR - https://www.scopus.com/pages/publications/85016221403

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:85016221403

SN - 1862-4405

VL - 9511

JO - Dagstuhl Seminar Proceedings

JF - Dagstuhl Seminar Proceedings

T2 - Parameterized Complexity and Approximation Algorithms 2009

Y2 - 13 December 2009 through 17 December 2009

ER -