Fingerprint
Dive into the research topics of 'Approximating node-weighted k-MST on planar graphs'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
Approximating node-weighted k-MST on planar graphs
Jarosław Byrka, Mateusz Lewandowski*, Joachim Spoerhase
*Corresponding author for this work
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review