Results 11 
18 of
18
Nearlineartime deterministic plane Steiner spanners and TSP approximation for wellspaced point sets
 In Proceedings of the 24th Annual Canadian Conference on Computational Geometry (CCCG
, 2012
"... We describe an algorithm that takes as input n points in the plane and a parameter , and produces as output an embedded planar graph having the given points as a subset of its vertices in which the graph distances are a (1 + )approximation to the geometric distances between the given points. For po ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
We describe an algorithm that takes as input n points in the plane and a parameter , and produces as output an embedded planar graph having the given points as a subset of its vertices in which the graph distances are a (1 + )approximation to the geometric distances between the given points. For point sets in which the Delaunay triangulation has sharpest angle α, our algorithm’s output has O(β 2 n) vertices, its weight is O ( β α) times the minimum spanning tree weight where β = 1 α log 1 α. The algorithm’s running time, if a Delaunay triangulation is given, is linear in the size of the output. We use this result in a similarly fast deterministic approximation scheme for the traveling salesperson problem. 1
Faster shortest noncontractible cycles in directed surface graphs
 CoRR
"... Let G be a directed graph embedded on a surface of genus g with b boundary cycles. We describe an algorithm to compute the shortest noncontractible cycle in G in O((g 3 + g b)n log n) time. Our algorithm improves the previous best known time bound of (g + b) O(g+b) n log n for all positive g and b. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Let G be a directed graph embedded on a surface of genus g with b boundary cycles. We describe an algorithm to compute the shortest noncontractible cycle in G in O((g 3 + g b)n log n) time. Our algorithm improves the previous best known time bound of (g + b) O(g+b) n log n for all positive g and b. We also describe an algorithm to compute the shortest nonnullhomologous cycle in G in O((g 2 + g b)n log n) time, generalizing a known algorithm to compute the shortest nonseparating cycle.
FAST ALGORITHMS FOR SURFACE EMBEDDED GRAPHS VIA HOMOLOGY
, 2013
"... We describe several results on combinatorial optimization problems for graphs where the input comes with an embedding on an orientable surface of small genus. While the specific techniques used differ between problems, all the algorithms we describe share one common feature in that they rely on the ..."
Abstract
 Add to MetaCart
(Show Context)
We describe several results on combinatorial optimization problems for graphs where the input comes with an embedding on an orientable surface of small genus. While the specific techniques used differ between problems, all the algorithms we describe share one common feature in that they rely on the algebraic topology construct of homology. We describe algorithms to compute global minimum cuts and count minimum s, tcuts. We describe new algorithms to compute short cycles that are topologically nontrivial. Finally, we describe ongoing work in designing a new algorithm for computing maximum s, tflows in surface embedded graphs. We begin by describing an algorithm to compute global minimum cuts in edge weighted genus g graphs in gO(g)n log log n time. When the genus is a constant, our algorithm’s running time matches the best time bound known for planar graphs due to La̧cki and Sankowski. In our algorithm, we reduce to the problem of finding a minimum weight separating subgraph in the dual
APPROXIMATION ALGORITHMS FOR SUBMODULAR OPTIMIZATION AND GRAPH PROBLEMS
, 2013
"... In this thesis, we consider combinatorial optimization problems involving submodular functions and graphs. The problems we study are NPhard and therefore, assuming that P 6 = NP, there do not exist polynomialtime algorithms that always output an optimal solution. In order to cope with the intracta ..."
Abstract
 Add to MetaCart
(Show Context)
In this thesis, we consider combinatorial optimization problems involving submodular functions and graphs. The problems we study are NPhard and therefore, assuming that P 6 = NP, there do not exist polynomialtime algorithms that always output an optimal solution. In order to cope with the intractability of these problems, we focus on algorithms that construct approximate solutions: An approximation algorithm is a polynomialtime algorithm that, for any instance of the problem, it outputs a solution whose value is within a multiplicative factor ρ of the value of the optimal solution for the instance. The quantity ρ is the approximation ratio of the algorithm and we aim to achieve the smallest ratio possible. Our focus in this thesis is on designing approximation algorithms for several combinatorial optimization problems. In the first part of this thesis, we study a class of constrained submodular minimization problems. We introduce a model that captures allocation problems with submodular costs and we give a generic approach for designing approximation algorithms for problems in this model. Our model captures several problems of interest, such as nonmetric facility location, multiway cut problems in graphs and hypergraphs, uniform metric labeling and its generalization
Optimization
"... It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one gives an embedding into a distribution over planar graphs with distortion 2O(g). By removing all g handles at once, we present ..."
Abstract
 Add to MetaCart
(Show Context)
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one gives an embedding into a distribution over planar graphs with distortion 2O(g). By removing all g handles at once, we present a probabilistic embedding with distortion O(g2) for both orientable and nonorientable graphs. Our result is obtained by showing that the minimumcut graph of [6] has low dilation, and then randomly cutting this graph out of the surface using the Peeling Lemma from [13].
Counting and Sampling Minimum Cuts in Genus g Graphs
, 2012
"... Let G be a directed graph with n vertices embedded on an orientable surface of genus g with two designated vertices s and t. We show that counting the number of minimum (s, t)cuts in G is fixed parameter tractable in g. Specially, we give a 2 O(g) n 2 + min { n 2 log n, g O(g) n 3/2} time algorithm ..."
Abstract
 Add to MetaCart
Let G be a directed graph with n vertices embedded on an orientable surface of genus g with two designated vertices s and t. We show that counting the number of minimum (s, t)cuts in G is fixed parameter tractable in g. Specially, we give a 2 O(g) n 2 + min { n 2 log n, g O(g) n 3/2} time algorithm for this problem. Our algorithm requires counting sets of cycles in a particular integer homology class. That we can count these cycles is an interesting result in itself as there are few prior results that are fixed parameter tractable and deal directly with integer homology. We also describe an algorithm which, after running our algorithm to count the number of cuts once, can sample repeatedly for a minimum cut in O(g 2 n) time per sample.