Yauheniya Lahoda

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We show that every planar straight line graph (PSLG) with n vertices can be augmented to a 2-edge-connected PSLG with the addition of at most (4n − 4)/3 new edges. This bound is the best possible. Edge-connectivity augmentation is a classic problem in combinatorial optimization motivated by applications in fault-tolerant network design. Given an undirected(More)
  • 1