Sciweavers

11 search results - page 1 / 3
» Lower Bounds for Embedding into Distributions over Excluded ...
Sort
View
68
Voted
ESA
2004
Springer
103views Algorithms» more  ESA 2004»
15 years 2 months ago
Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families
Douglas E. Carroll, Ashish Goel
FOCS
2008
IEEE
15 years 3 months ago
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
Amit Chakrabarti, Alexander Jaffe, James R. Lee, J...
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
15 years 10 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos
NIPS
2007
14 years 10 months ago
Local Algorithms for Approximate Inference in Minor-Excluded Graphs
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
Kyomin Jung, Devavrat Shah
FOCS
2003
IEEE
15 years 2 months ago
Bounded Geometries, Fractals, and Low-Distortion Embeddings
The doubling constant of a metric space (X, d) is the smallest value λ such that every ball in X can be covered by λ balls of half the radius. The doubling dimension of X is the...
Anupam Gupta, Robert Krauthgamer, James R. Lee