Primal-dual approximation algorithms for node-weighted network design in planar graphs

Piotr Berman, Grigory Yaroslavtsev

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    10 Scopus citations

    Fingerprint

    Dive into the research topics of 'Primal-dual approximation algorithms for node-weighted network design in planar graphs'. Together they form a unique fingerprint.

    Mathematics

    Engineering & Materials Science