Crossmark

An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs

Crossref DOI link: https://doi.org/10.1007/s00453-018-0504-8

Published Online: 2018-08-23

Published Print: 2019-10

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Karpov, Nikolai

Pilipczuk, Marcin

Zych-Pawlewicz, Anna
Funding

Funding for this research was provided by:

H2020 European Research Council (714704, 714704)

Government of the Russian Federation (14.Z50.31.0030)

Warsaw Centre of Mathematics and Computer Science
License Information

Text and Data Mining valid from 2018-08-23
More Information

Article History

Received: 30 December 2017

Accepted: 12 August 2018

First Online: 23 August 2018