Skip to main navigation Skip to search Skip to main content

Approximating minimum cost connectivity problems via uncrossable bifamilies and spider-cover decompositions

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Fingerprint

Dive into the research topics of 'Approximating minimum cost connectivity problems via uncrossable bifamilies and spider-cover decompositions'. Together they form a unique fingerprint.
Sort by

Keyphrases

Computer Science

Mathematics