An <italic toggle='yes'>O</italic>(<italic toggle='yes'>n</italic> log <italic toggle Page 1 31 An
O(nlogn) Approximation Scheme for Steiner Tree in Planar Graphs GLENCORA BORRADAILE …

Understanding the structure of minor-free metrics, namely shortest path metrics obtained
over a weighted graph excluding a fixed minor, has been an important research direction …

We present the first polynomial-time approximation schemes (PTAS es) for the following
subset-connectivity problems in edge-weighted graphs of bounded-genus: Steiner tree, low …

Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar
graphs Page 1 Linear-Time Algorithms for Max Flow and Multiple-Source Shortest Paths in …

In correlation clustering, the input is a graph with edge-weights, where every edge is
labelled either+ or-according to similarity of its endpoints. The goal is to produce a partition …

By restricting the input to a problem, it often becomes possible to design more accurate or
more efficient algorithms to solve that problem. In this thesis we restrict our attention to …

We present the first attempt on implementing a highly theoretical polynomial-time
approximation scheme (PTAS) with huge hidden constants, namely, the PTAS for Steiner …

This thesis presents approximation algorithms for some [special characters omitted]-Hard
combinatorial optimization problems on graphs and networks; in particular, we study …

We survey the area of the design of approximation schemes for geometric variants of the
following classical optimization problem: For a given undirected weighted graph, find its …

We present the first polynomial-time approximation schemes, ie,(1+{\epsilon})-
approximation algorithm for any constant {\epsilon}> 0, for the minimum three-edge …