Results 1  10
of
24
Improved approximation algorithms for minimum weight vertex separators
 In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, FOCS’89
, 1989
"... vertex separators ..."
(Show Context)
Approximation algorithms via contraction decomposition
 Proc. 18th Ann. ACMSIAM Symp. Discrete Algorithms ACMSIAM symposium on Discrete algorithms
, 2007
"... We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bounded treewidth (where the bound depends on k). This decomposition result parallels an analogous, simpler result for edge ..."
Abstract

Cited by 37 (8 self)
 Add to MetaCart
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bounded treewidth (where the bound depends on k). This decomposition result parallels an analogous, simpler result for edge deletions instead of contractions, obtained in [Bak94, Epp00, DDO + 04, DHK05], and it generalizes a similar result for “compression ” (a variant of contraction) in planar graphs [Kle05]. Our decomposition result is a powerful tool for obtaining PTASs for contractionclosed problems (whose optimal solution only improves under contraction), a much more general class than minorclosed problems. We prove that any contractionclosed problem satisfying just a few simple conditions has a PTAS in boundedgenus graphs. In particular, our framework yields PTASs for the weighted Traveling Salesman Problem and for minimumweight cedgeconnected submultigraph on boundedgenus graphs, improving and generalizing previous algorithms of [GKP95, AGK + 98, Kle05, Gri00, CGSZ04, BCGZ05]. We also highlight the only main difficulty in extending our results to general Hminorfree graphs.
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
"... ..."
(Show Context)
Expander graphs, gonality and variation of Galois representations, arXiv:1008.3675 [EMV
 Duke Math. J
"... Abstract. We show that families of coverings of an algebraic curve where the associated CayleySchreier graphs form an expander family exhibit strong forms of geometric growth. Combining this general result with finiteness statements for rational points under such conditions, we derive results conce ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
(Show Context)
Abstract. We show that families of coverings of an algebraic curve where the associated CayleySchreier graphs form an expander family exhibit strong forms of geometric growth. Combining this general result with finiteness statements for rational points under such conditions, we derive results concerning the variation of Galois representations in oneparameter families of abelian varieties. 1.
Spectral algorithms
, 2009
"... Summary. Spectral methods refer to the use of eigenvalues, eigenvectors, singular values and singular vectors. They are widely used in Engineering, Applied Mathematics and Statistics. More recently, spectral methods have found numerous applications in Computer Science to “discrete ” as well “continu ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
Summary. Spectral methods refer to the use of eigenvalues, eigenvectors, singular values and singular vectors. They are widely used in Engineering, Applied Mathematics and Statistics. More recently, spectral methods have found numerous applications in Computer Science to “discrete ” as well “continuous” problems. This book describes modern applications of spectral methods, and novel algorithms for estimating spectral parameters. In the first part of the book, we present applications of spectral methods to problems from a variety of topics including combinatorial optimization, learning and clustering. The second part of the book is motivated by efficiency considerations. A feature of many modern applications is the massive amount of input data. While sophisticated algorithms for matrix computations have been developed over a century, a more recent development is algorithms based on “sampling on the fly ” from massive matrices. Good estimates of singular values and low rank approximations of the whole matrix can be provably derived from a sample. Our
On the blackbox complexity of Sperner’s Lemma
 In FCT 2005
, 2005
"... We present several results on the complexity of various forms of Sperner’s Lemma. In the blackbox model of computing, we exhibit a deterministic algorithm for Sperner problems over pseudomanifolds of arbitrary dimension. The query complexity of our algorithm is essentially linear in the separation ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
(Show Context)
We present several results on the complexity of various forms of Sperner’s Lemma. In the blackbox model of computing, we exhibit a deterministic algorithm for Sperner problems over pseudomanifolds of arbitrary dimension. The query complexity of our algorithm is essentially linear in the separation number of the skeleton graph of the manifold and the size of its boundary. As a corollary we get an O ( √ n) deterministic query algorithm for the blackbox version of the problem 2DSPERNER, a well studied member of Papadimitriou’s complexity class PPAD. This upper bound matches the Ω ( √ n) deterministic lower bound of Crescenzi and Silvestri. In another blackbox result we prove for the same problem an Ω ( 4 √ n) lower bound for its probabilistic, and an Ω ( 8 √ n) lower bound for its quantum query complexity, showing that all these measures are polynomially related. Finally we explicit Sperner problems on a 2dimensional pseudomanifold and prove that they are complete respectively for the classes PPAD, PPADS and PPA. This is the first time that a 2dimensional Sperner problem is proved to be complete for any of the polynomial parity argument classes. 1
Improved cheeger’s inequality: analysis of spectral partitioning algorithms through higher order spectral gap
 In 45th annual ACM symposium on Symposium on theory of computing, STOC ’13
, 2013
"... Let φ(G) be the minimum conductance of an undirected graph G, and let 0 = λ1 ≤ λ2 ≤... ≤ λn ≤ 2 be the eigenvalues of the normalized Laplacian matrix of G. We prove that for any graph G and any k ≥ 2, φ(G) = O(k) λ2√ λk and this performance guarantee is achieved by the spectral partitioning algorit ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
Let φ(G) be the minimum conductance of an undirected graph G, and let 0 = λ1 ≤ λ2 ≤... ≤ λn ≤ 2 be the eigenvalues of the normalized Laplacian matrix of G. We prove that for any graph G and any k ≥ 2, φ(G) = O(k) λ2√ λk and this performance guarantee is achieved by the spectral partitioning algorithm. This improves Cheeger’s inequality, and the bound is optimal up to a constant factor for any k. Our result shows that the spectral partitioning algorithm is a constant factor approximation algorithm for finding a sparse cut if λk is a constant for some constant k. This provides some theoretical justification to its empirical performance in image segmentation and clustering problems. We extend the analysis to spectral algorithms for other graph partitioning problems, including multiway partition, balanced separator, and maximum cut.
Metric uniformization and spectral bounds for graphs
"... We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate “Riemannian ” metric to uniformize the geometry of the graph. In many interesting cases, the existence of such a metric is shown by examining the combinatorics of spec ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
(Show Context)
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate “Riemannian ” metric to uniformize the geometry of the graph. In many interesting cases, the existence of such a metric is shown by examining the combinatorics of special types of flows. This involves proving new inequalities on the crossing number of graphs. In particular, we use our method to show that for any positive integer k, the k th smallest eigenvalue of the Laplacian on an nvertex, boundeddegree planar graph is O(k/n). This bound is asymptotically tight for every k, as it is easily seen to be achieved for square planar grids. We also extend this spectral result to graphs with bounded genus, and graphs which forbid fixed minors. Previously, such spectral upper bounds were only known for the case k = 2. 1
Higher eigenvalues of graphs
"... We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In particular, we show that for any positive integer k, the k th smallest eigenvalue of the Laplacian on a boundeddegree planar graph is O(k/n). This bound is asymptotically tight for every k, as it is ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In particular, we show that for any positive integer k, the k th smallest eigenvalue of the Laplacian on a boundeddegree planar graph is O(k/n). This bound is asymptotically tight for every k, as it is easily seen to be achieved for planar grids. We also extend this spectral result to graphs with bounded genus, graphs which forbid fixed minors, and other natural families. Previously, such spectral upper bounds were only known for k = 2, i.e. for the Fiedler value of these graphs. In addition, our result yields a new, combinatorial proof of the celebrated result of Korevaar in differential geometry.