Igor Balla REU DIMACS 2010. Metric Spaces 1. 2. 3. 4.

Slides:

Advertisements

Similar presentations

Approximate Max-integral-flow/min-cut Theorems Kenji Obata UC Berkeley June 15, 2004.

Advertisements

Space-Efficient Static Trees and Graphs Guy Jacobson IEEE Symposium on Foundations of Computer Science, 1989 Speaker: 吳展碩.

On the properties of relative plausibilities Computer Science Department UCLA Fabio Cuzzolin SMC05, Hawaii, October

Real-Time Competitive Environments: Truthful Mechanisms for Allocating a Single Processor to Sporadic Tasks Anwar Mohammadi, Nathan Fisher, and Daniel.

Algorithm & Application

Vertex sparsifiers: New results from old techniques (and some open questions) Robert Krauthgamer (Weizmann Institute) Joint work with Matthias Englert,

Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.

HOW IT ALL BEGAN….. The Forward Look “Mathematics and Industry”

Huseyin Ergin and Eugene Syriani University of Alabama Software Modeling Lab Software Engineering Group Department of Computer Science College of Engineering.

M. Belkin and P. Niyogi, Neural Computation, pp. 1373–1396, 2003.

Instructor Neelima Gupta Table of Contents Approximation Algorithms.

Graph Vertex Colorability & the Hardness Mengfei Cao COMP-150 Graph Theory Tufts University Dec. 15 th, Presentation for Final Project.

Geometric embeddings and graph expansion James R. Lee Institute for Advanced Study (Princeton) University of Washington (Seattle)

Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion Ittai Abraham, Yair Bartal, Ofer Neiman The Hebrew.

Paths, Trees and Minimum Latency Tours Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, Satish Rao, Kunal Talwar UC Berkeley.

Interchanging distance and capacity in probabilistic mappings Uriel Feige Weizmann Institute.

Based on “Cascading Behavior in Networks: Algorithmic and Economic Issues” in Algorithmic Game Theory (Jon Kleinberg, 2007) and Ch.16 and 19 of Networks,

Presented by Arshad Jamal, Rajesh Dhania, Vinkal Vishnoi Active hashing and its application to image and text retrieval Yi Zhen, Dit-Yan Yeung, Published.

PCPs and Inapproximability Introduction. My T. Thai 2 Why Approximation Algorithms  Problems that we cannot find an optimal solution.

EECE Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.

SVP in Hard to Approximate to within some constant Based on Article by Daniele Micciancio IEEE Symposium on Foundations of Computer Science (FOCS.

Network Design Adam Meyerson Carnegie-Mellon University.

Approximating metrics by tree metrics Kunal Talwar Microsoft Research Silicon Valley Joint work with Jittat Fakcharoenphol Kasetsart University Thailand.

Advances in Metric Embedding Theory Ofer Neiman Ittai Abraham Yair Bartal Hebrew University.

Augmenting Paths, Witnesses and Improved Approximations for Bounded Degree MSTs K. Chaudhuri, S. Rao, S. Riesenfeld, K. Talwar UC Berkeley.

Randomized Competitive Analysis for Two Server Problems Wolfgang Bein Kazuo Iwama Jun Kawahara.

Online Matching for Internet Auctions DIMACS REU Presentation 20 June 2006 Slide 1 Online Matching for Internet Auctions Ben Sowell Advisor: S. Muthukrishnan.

EECE Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.

Visualization of Clusters with a Density-Based Similarity Measure Rebecca Nugent Department of Statistics, Carnegie Mellon University June 9, 2007 Joint.

Hierarchical Graph Cuts for Semi-Metric Labeling M. Pawan Kumar Joint work with Daphne Koller.

Presented by Justin Chester.  Sensor Networks ◦ Resource Constraints ◦ Multimedia Support  Mobility ◦ Path Planning & Tour Planning ◦ Optimization &

Volume distortion for subsets of R n James R. Lee Institute for Advanced Study & University of Washington Symposium on Computational Geometry, 2006; Sedona,

Distance Approximating Trees in Graphs

Chandra Chekuri, Nitish Korula and Martin Pal Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms (SODA 08) Improved Algorithms.

Randomized Online Algorithm for Minimum Metric Bipartite Matching Adam Meyerson UCLA.

Physics Fluctuomatics (Tohoku University) 1 Physical Fluctuomatics 12th Bayesian network and belief propagation in statistical inference Kazuyuki Tanaka.

KLASING, R., MARKOU, E. & RADZIK, T. (2007). HARDNESS AND APPROXIMATION RESULTS FOR BLACK HOLE SEARCH IN ARBITRARY NETWORKS. THEOR. COMPUT. SCI., 384 (2-3),

University at BuffaloThe State University of New York Lei Shi Department of Computer Science and Engineering State University of New York at Buffalo Frequent.

Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality Piotr Indyk, Rajeev Motwani The 30 th annual ACM symposium on theory of computing.

Topics in Algorithms 2007 Ramesh Hariharan. Tree Embeddings.

Hierarchical Well-Separated Trees (HST) Edges’ distances are uniform across a level of the tree Stretch  = factor by which distances decrease from root.

A Optimal On-line Algorithm for k Servers on Trees Author : Marek Chrobak Lawrence L. Larmore 報告人：羅正偉.

Introduction to the k-Server Problem Marcel Birkner.

Minimum Back-Walk-Free Latency Problem with Multiple Servers Yaw-Ling Lin ( 林耀鈴 ) Dept Computer Sci. & Info. Management, Providence University, Taichung,

Advances in Metric Embedding Theory Yair Bartal Hebrew University &Caltech UCLA IPAM 07.

1.2 Slope of a Curve at a Point. We want to extend the concept of slope from straight lines to more general curves. To do this, we must introduce the.

Spanning Trees Alyce Brady CS 510: Computer Algorithms.

Graduate School of Information Sciences, Tohoku University

Approximating Graphs by Trees Marcin Bieńkowski University of Wrocław

Science Planner 12/7/16 WALT: understand and graph Sunspot cycles.

Efficient methods for finding low-stretch spanning trees

European Symposium on Algorithms – ESA

Moving Companies in VA Moving Companies in Washington DC.

Implications of the ETH

Towards Next Generation Panel at SAINT 2002

Albert Park, Ph.D. Background: Public Health Informatics, Consumer Health Informatics, Data and Computational Science, Human-Computer.

Simulation based approach Shang Zechao

Example of a Two Page Poster

EDLC(Embedded system Development Life Cycle ).

Graduate School of Information Sciences, Tohoku University

Metric Methods and Approximation Algorithms

Randomized Online Algorithm for Minimum Metric Bipartite Matching

Graduate School of Information Sciences, Tohoku University

New Jersey, October 9-11, 2016 Field of theoretical computer science

Integrating Class Hierarchies

Give the parent, queue, BFI (breadth first index), and level arrays when BFS is applied to this graph starting at vertex 0. Process the neighbours of each.

Graduate School of Information Sciences, Tohoku University

Data-Dependent Approximation

Presentation transcript:

Igor Balla REU DIMACS 2010

Metric Spaces

Graph Metrics

Metric Embedding

Approximating Cycle Metrics

Probabilistic Approximations by Tree Metrics

Directions for Further Research 1. Bartal, Y Probabilistic approximations of metric spaces and its algorithmic applications. In Proceedings of the 37 th Annual Symposium on Foundations of Computer Science (October 14-16, 1996). FOCS. IEEE Computer Society, Washington, DC, Fakcharoenphol, J., Rao, S., Talwar, K A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69, 3 (Nov. 2004), Karp, R A 2k-competitive algorithm for the circle. Manuscript (August 1989) References