Lower Bounds for. Local Approximation. Mika Göös, Juho Hirvonen & Jukka Suomela (HIIT) Göös et al. (HIIT) Local Approximation 2nd April / 19
|
|
- Christian Hardy
- 5 years ago
- Views:
Transcription
1 Lower Bounds for Local Approximation Mika Göös, Juho Hirvonen & Jukka Suomela (HIIT) Göös et al. (HIIT) Local Approximation nd April 0 / 9
2 Lower Bounds for Local Approximation We prove: Local algorithms do not need unique IDs when computing approximations to graph optimization problems Göös et al. (HIIT) Local Approximation nd April 0 / 9
3 Input = Graph G = Communication Network Göös et al. (HIIT) Local Approximation nd April 0 3 / 9
4 Simple Graph Problems Old Classics Independent sets Göös et al. (HIIT) Local Approximation nd April 0 4 / 9
5 Simple Graph Problems Old Classics Independent sets Vertex covers Göös et al. (HIIT) Local Approximation nd April 0 4 / 9
6 Simple Graph Problems Old Classics Independent sets Vertex covers 3 Dominating sets Göös et al. (HIIT) Local Approximation nd April 0 4 / 9
7 Simple Graph Problems Old Classics Independent sets Vertex covers 3 Dominating sets 4 Matchings Göös et al. (HIIT) Local Approximation nd April 0 4 / 9
8 Simple Graph Problems Old Classics Independent sets Vertex covers 3 Dominating sets 4 Matchings 5 Edge covers Göös et al. (HIIT) Local Approximation nd April 0 4 / 9
9 Simple Graph Problems Old Classics Independent sets Vertex covers 3 Dominating sets 4 Matchings 5 Edge covers 6 Edge dom. sets 7 Etc... Göös et al. (HIIT) Local Approximation nd April 0 4 / 9
10 Local Algorithms Distributed algorithm A Deterministic, synchronous Göös et al. (HIIT) Local Approximation nd April 0 5 / 9
11 Local Algorithms Distributed algorithm A Deterministic, synchronous Göös et al. (HIIT) Local Approximation nd April 0 5 / 9
12 Local Algorithms Distributed algorithm A Deterministic, synchronous Göös et al. (HIIT) Local Approximation nd April 0 5 / 9
13 Local Algorithms Distributed algorithm A Deterministic, synchronous Göös et al. (HIIT) Local Approximation nd April 0 5 / 9
14 Local Algorithms Distributed algorithm A Deterministic, synchronous Göös et al. (HIIT) Local Approximation nd April 0 5 / 9
15 Local Algorithms Distributed algorithm A Deterministic, synchronous 3 Locality: running time r of A is independent of n = G may depend on maximum degree of G Göös et al. (HIIT) Local Approximation nd April 0 5 / 9
16 Local Algorithms Distributed algorithm A Deterministic, synchronous 3 Locality: running time r of A is independent of n = G may depend on maximum degree of G On bounded degree graphs ( = O()) running time is a constant: r N (e.g., r = 3) Göös et al. (HIIT) Local Approximation nd April 0 5 / 9
17 Local Algorithms Definition: A : { } {0, } Göös et al. (HIIT) Local Approximation nd April 0 6 / 9
18 Local Algorithms Definition: A : { } {0, } Output: Vertex set: Set of vertices v with A(G, v) = Göös et al. (HIIT) Local Approximation nd April 0 6 / 9
19 Local Algorithms Definition: A : { } {0, } Output: Vertex set: Set of vertices v with A(G, v) = Edge set: A(G, v) is a vector of length indicating which edges incident to v are included Göös et al. (HIIT) Local Approximation nd April 0 6 / 9
20 Two Network Models Unique Identifiers Anonymous Networks with Port Numbering Göös et al. (HIIT) Local Approximation nd April 0 7 / 9
21 Two Network Models Unique Identifiers Each node has a unique O(log n)-bit label: Anonymous Networks with Port Numbering V(G) {,,..., poly(n)} Göös et al. (HIIT) Local Approximation nd April 0 7 / 9
22 Two Network Models Unique Identifiers Each node has a unique O(log n)-bit label: V(G) {,,..., poly(n)} Anonymous Networks with Port Numbering Node v can refer to its neighbours via ports,,..., deg(v) Edges are oriented Göös et al. (HIIT) Local Approximation nd April 0 7 / 9
23 Example: Independent Sets on a Cycle ID-model PO-model Göös et al. (HIIT) Local Approximation nd April 0 8 / 9
24 Example: Independent Sets on a Cycle ID-model PO-model [Cole Vishkin 86, Linial 9]: Maximal independent set can be computed in Θ(log n) rounds Göös et al. (HIIT) Local Approximation nd April 0 8 / 9
25 Example: Independent Sets on a Cycle ID-model PO-model [Cole Vishkin 86, Linial 9]: Maximal independent set can be computed in Θ(log n) rounds Above PO-network is fully symmetric Göös et al. (HIIT) Local Approximation nd April 0 8 / 9
26 Example: Independent Sets on a Cycle ID-model PO-model [Cole Vishkin 86, Linial 9]: Maximal independent set can be computed in Θ(log n) rounds Above PO-network is fully symmetric All nodes give same output Göös et al. (HIIT) Local Approximation nd April 0 8 / 9
27 Example: Independent Sets on a Cycle ID-model PO-model [Cole Vishkin 86, Linial 9]: Maximal independent set can be computed in Θ(log n) rounds Above PO-network is fully symmetric All nodes give same output Empty set is computed! Göös et al. (HIIT) Local Approximation nd April 0 8 / 9
28 Example: Independent Sets on a Cycle 5 ID-model in general PO-model [Cole Vishkin 86, Linial 9]: Maximal independent set can be computed in Θ(log n) rounds Above PO-network is fully symmetric All nodes give same output Empty set is computed! Göös et al. (HIIT) Local Approximation nd April 0 8 / 9
29 Example: Independent Sets on a Cycle ID-model PO-model [Lenzen Wattenhofer 08, Czygrinow et al. 08]: MIS cannot be approximated to within a constant factor in O() rounds! Above PO-network is fully symmetric All nodes give same output Empty set is computed! Göös et al. (HIIT) Local Approximation nd April 0 8 / 9
30 Example: Independent Sets on a Cycle 5 ID-model for Local Approximation PO-model [Lenzen Wattenhofer 08, Czygrinow et al. 08]: MIS cannot be approximated to within a constant factor in O() rounds! Above PO-network is fully symmetric All nodes give same output Empty set is computed! Göös et al. (HIIT) Local Approximation nd April 0 8 / 9
31 Known Approximation Ratios ID PO Max Independent Set Max Matching Min Vertex Cover Min Edge Cover Min Dominating Set + + ( := / ) Göös et al. (HIIT) Local Approximation nd April 0 9 / 9
32 Known Approximation Ratios ID PO Max Independent Set Max Matching Min Vertex Cover Min Edge Cover Min Dominating Set + + ( := / ) Min Edge Dominating Set α 4 / 3 α 4 /??? Göös et al. (HIIT) Local Approximation nd April 0 9 / 9
33 Our Result (informally) Main Thm: When Local Algorithms compute constant factor approximations, ID = PO for a general class of graph problems Göös et al. (HIIT) Local Approximation nd April 0 0 / 9
34 Proof! Göös et al. (HIIT) Local Approximation nd April 0 / 9
35 OI: Order Invariant Algorithms [Naor Stockmeyer 95]: Ramsey s theorem implies that local ID-algorithms can only compare identifiers ID = OI? = PO Göös et al. (HIIT) Local Approximation nd April 0 / 9
36 OI: Order Invariant Algorithms [Naor Stockmeyer 95]: Ramsey s theorem implies that local ID-algorithms can only compare identifiers ID = OI? = PO Order invariant algorithm A: Input: Ordered graph (G, ) Output: A(G,, v) depends only on order type of the radius-r neighbourhood of v Göös et al. (HIIT) Local Approximation nd April 0 / 9
37 Example: Ordered Cycle Göös et al. (HIIT) Local Approximation nd April 0 3 / 9
38 Example: Ordered Cycle Göös et al. (HIIT) Local Approximation nd April 0 3 / 9
39 Example: Ordered Cycle Göös et al. (HIIT) Local Approximation nd April 0 3 / 9
40 Example: Ordered Cycle Göös et al. (HIIT) Local Approximation nd April 0 3 / 9
41 Example: Ordered Cycle Göös et al. (HIIT) Local Approximation nd April 0 3 / 9
42 Example: Ordered Cycle Göös et al. (HIIT) Local Approximation nd April 0 3 / 9
43 Example: Ordered Cycle Göös et al. (HIIT) Local Approximation nd April 0 3 / 9
44 Example: Ordered Cycle On a large enough cycle ( ɛ)-fraction of neighbourhoods are isomorphic Göös et al. (HIIT) Local Approximation nd April 0 3 / 9
45 Example: Ordered Cycle On a large enough cycle ( ɛ)-fraction of neighbourhoods are isomorphic OI-algorithm outputs the same almost everywhere! Göös et al. (HIIT) Local Approximation nd April 0 3 / 9
46 Two Advantages of OI over PO. Global linear order vs. Local port numbering Linear order introduces symmetry breaking Main challenge: How to control this? Göös et al. (HIIT) Local Approximation nd April 0 4 / 9
47 Two Advantages of OI over PO. Global linear order vs. Local port numbering Linear order introduces symmetry breaking Main challenge: How to control this?. PO-algorithms cannot detect small cycles Göös et al. (HIIT) Local Approximation nd April 0 4 / 9
48 Two Advantages of OI over PO. Global linear order vs. Local port numbering Linear order introduces symmetry breaking Main challenge: How to control this?. PO-algorithms cannot detect small cycles? = Göös et al. (HIIT) Local Approximation nd April 0 4 / 9
49 Two Advantages of OI over PO. Global linear order vs. Local port numbering Linear order introduces symmetry breaking Main challenge: How to control this?. PO-algorithms cannot detect small cycles This disadvantage disappears on high girth graphs Göös et al. (HIIT) Local Approximation nd April 0 4 / 9
50 Two Advantages of OI over PO. Global linear order vs. Local port numbering Linear order introduces symmetry breaking Main challenge: How to control this?. PO-algorithms cannot detect small cycles This disadvantage disappears on high girth graphs We assume: Feasibility of a solution can be checked by a PO-algorithm Göös et al. (HIIT) Local Approximation nd April 0 4 / 9
51 Two Advantages of OI over PO + = Need to understand linear orders on high girth graphs Göös et al. (HIIT) Local Approximation nd April 0 5 / 9
52 Order Homogeneity Definition: We say that an ordered graph (G, ) is (α, r)-homogeneous if α-fraction of nodes have isomorphic radius-r neighbourhoods Göös et al. (HIIT) Local Approximation nd April 0 6 / 9
53 Order Homogeneity Definition: We say that an ordered graph (G, ) is (α, r)-homogeneous if α-fraction of nodes have isomorphic radius-r neighbourhoods Example: Large cycles are ( ɛ, r)-homogeneous (α = not possible) Göös et al. (HIIT) Local Approximation nd April 0 6 / 9
54 Homogeneous High Girth Graphs ( ɛ, r)-homogeneous k-regular 3 Large girth 4 Finite graph Göös et al. (HIIT) Local Approximation nd April 0 7 / 9
55 Homogeneous High Girth Graphs ( ɛ, r)-homogeneous k-regular 3 Large girth 4 Finite graph Göös et al. (HIIT) Local Approximation nd April 0 7 / 9
56 Homogeneous High Girth Graphs ( ɛ, r)-homogeneous k-regular 3 Large girth 4 Finite graph Göös et al. (HIIT) Local Approximation nd April 0 7 / 9
57 Homogeneous High Girth Graphs ( ɛ, r)-homogeneous k-regular 3 Large girth 4 Finite graph Göös et al. (HIIT) Local Approximation nd April 0 7 / 9
58 Homogeneous High Girth Graphs ( ɛ, r)-homogeneous k-regular 3 Large girth 4 Finite graph Göös et al. (HIIT) Local Approximation nd April 0 7 / 9
59 Homogeneous High Girth Graphs ( ɛ, r)-homogeneous k-regular 3 Large girth 4 Finite graph } Main Technical Result: Graphs (H ɛ, ɛ ) with properties 4 exist Göös et al. (HIIT) Local Approximation nd April 0 7 / 9
60 Homogeneous High Girth Graphs ( ɛ, r)-homogeneous k-regular 3 Large girth 4 Finite graph } Main Technical Result: Graphs (H ɛ, ɛ ) with properties 4 exist Proof. We use Cayley graphs of soluble groups Göös et al. (HIIT) Local Approximation nd April 0 7 / 9
61 Homogeneous High Girth Graphs ( ɛ, r)-homogeneous k-regular 3 Large girth 4 Finite graph } Main Technical Result: Graphs (H ɛ, ɛ ) with properties 4 exist? F(α, β) Z Z Göös et al. (HIIT) Local Approximation nd April 0 7 / 9
62 Homogeneous High Girth Graphs ( ɛ, r)-homogeneous k-regular 3 Large girth 4 Finite graph } Main Technical Result: Graphs (H ɛ, ɛ ) with properties 4 exist Want: Invariant order: x < y gx < gy F(α, β) Z Z Göös et al. (HIIT) Local Approximation nd April 0 7 / 9
63 Homogeneous High Girth Graphs ( ɛ, r)-homogeneous k-regular 3 Large girth 4 Finite graph } Main Technical Result: Graphs (H ɛ, ɛ ) with properties 4 exist Want: Invariant order Polynomial growth [Gromov s theorem] F(α, β) Z Z Göös et al. (HIIT) Local Approximation nd April 0 7 / 9
64 Homogeneous High Girth Graphs ( ɛ, r)-homogeneous k-regular 3 Large girth 4 Finite graph } Main Technical Result: Graphs (H ɛ, ɛ ) with properties 4 exist Want: Invariant order Polynomial growth Large girth [Gamburd et al. 09] F(α, β) Z Z Göös et al. (HIIT) Local Approximation nd April 0 7 / 9
65 Homogeneous High Girth Graphs ( ɛ, r)-homogeneous k-regular 3 Large girth 4 Finite graph } Main Technical Result: Graphs (H ɛ, ɛ ) with properties 4 exist Want: Invariant order Polynomial growth Large girth F(α, β) G = Z, G i+ = (G i G i ) Z Z Z Göös et al. (HIIT) Local Approximation nd April 0 7 / 9
66 Homogeneous High Girth Graphs ( ɛ, r)-homogeneous k-regular 3 Large girth 4 Finite graph } Main Technical Result: Graphs (H ɛ, ɛ ) with properties 4 exist Proof of Main Thm: Form graph products (H ɛ, ɛ ) G Göös et al. (HIIT) Local Approximation nd April 0 7 / 9
67 Conclusion Our result: For Local Approximation, ID = OI = PO Open problems: Planar graphs? Applications elsewhere descriptive complexity? Göös et al. (HIIT) Local Approximation nd April 0 8 / 9
68 Cheers! Göös et al. (HIIT) Local Approximation nd April 0 9 / 9
Models of distributed computing: port numbering and local algorithms
Models of distributed computing: port numbering and local algorithms Jukka Suomela Adaptive Computing Group Helsinki Institute for Information Technology HIIT University of Helsinki FMT seminar, 26 February
More informationFast distributed graph algorithms. Juho Hirvonen Aalto University & HIIT
Fast distributed graph algorithms Juho Hirvonen Aalto University & HIIT Distributed 2 Distributed 3 Algorithms 4 Fast - the number of nodes n - the maximum degree Δ 5 Fast - the number of nodes n - the
More informationBipartite Vertex Cover
Bipartite Vertex Cover Mika Göös Jukka Suomela University of Toronto & HIIT University of Helsinki & HIIT Göös and Suomela Bipartite Vertex Cover 18th October 2012 1 / 12 LOCAL model Göös and Suomela Bipartite
More informationarxiv: v1 [cs.dc] 13 Oct 2008
A SIMPLE LOCAL 3-APPROXIMATION ALGORITHM FOR VERTEX COVER VALENTIN POLISHCHUK AND JUKKA SUOMELA arxiv:0810.2175v1 [cs.dc] 13 Oct 2008 Abstract. We present a local algorithm (constant-time distributed algorithm)
More informationDistributed Maximal Matching: Greedy is Optimal
Distributed Maximal Matching: Greedy is Optimal Jukka Suomela Helsinki Institute for Information Technology HIIT University of Helsinki Joint work with Juho Hirvonen Weimann Institute of Science, 7 November
More informationInstructions. Notation. notation: In particular, t(i, 2) = 2 2 2
Instructions Deterministic Distributed Algorithms, 10 21 May 2010, Exercises http://www.cs.helsinki.fi/jukka.suomela/dda-2010/ Jukka Suomela, last updated on May 20, 2010 exercises are merely suggestions
More informationDistributed Algorithms
Distributed Algorithms Jukka Suomela Aalto University, Finland 4 December 08 http://users.ics.aalto.fi/suomela/da/ Contents Foreword About the Course............................... vi Acknowledgements..............................
More informationApproximating max-min linear programs with local algorithms
Approximating max-min linear programs with local algorithms Patrik Floréen, Marja Hassinen, Petteri Kaski, Topi Musto, Jukka Suomela HIIT seminar 29 February 2008 Max-min linear programs: Example 2 / 24
More informationDistributed Algorithms
Distributed Algorithms Jukka Suomela Aalto University, Finland 4 December 2018 http://users.ics.aalto.fi/suomela/da/ Contents Foreword About the Course................... x Acknowledgements..................
More informationLocal 3-approximation algorithms for weighted dominating set and vertex cover in quasi unit-disk graphs
Local 3-approximation algorithms for weighted dominating set and vertex cover in quasi unit-disk graphs Marja Hassinen, Valentin Polishchuk, Jukka Suomela HIIT, University of Helsinki, Finland LOCALGOS
More informationA Lower Bound for the Distributed Lovász Local Lemma
A Lower Bound for the Distributed Lovász Local Lemma Tuomo Lempiäinen Department of Computer Science, Aalto University Helsinki Algorithms Seminar, University of Helsinki 3rd December 2015 1 / 29 Authors
More informationA Course on Deterministic Distributed Algorithms. Jukka Suomela
A Course on Deterministic Distributed Algorithms Jukka Suomela 8 April 204 Contents Introduction and Preliminaries. Scope............................ Distributed Systems as a Model of Computation...................2
More informationA Course on Deterministic Distributed Algorithms. Jukka Suomela
A Course on Deterministic Distributed Algorithms Jukka Suomela 8 April 04 Contents Introduction and Preliminaries. Scope................................. Distributed Systems as a Model of Computation...
More informationFabian Kuhn. Nicla Bernasconi, Dan Hefetz, Angelika Steger
Algorithms and Lower Bounds for Distributed Coloring Problems Fabian Kuhn Parts are joint work with Parts are joint work with Nicla Bernasconi, Dan Hefetz, Angelika Steger Given: Network = Graph G Distributed
More informationLCL problems on grids
LCL problems on grids Sebastian Brandt sebastian.brandt@tik.ee.ethz.ch ETH Zürich Juho Hirvonen juho.hirvonen@aalto.fi IRIF, CNRS and University Paris Diderot Janne H. Korhonen janne.h.korhonen@aalto.fi
More informationA Local O(1)-Approximation for Dominating Sets on Bounded Genus Graphs
A Local O(1)-Approximation for Dominating Sets on Bounded Genus Graphs Saeed Akhoondian Amiri Stefan Schmid Sebastian Siebertz Table of contents 1 Introduction 2 Definitions and Prelims 3 Algorithm 4 Analysis
More informationLocality in Distributed Graph Algorithms
Locality in Distributed Graph Algorithms Pierre Fraigniaud To cite this version: Pierre Fraigniaud. Locality in Distributed Graph Algorithms. Encyclopedia of Algorithms, Springer, pp.1143-1148, 2016, 978-1-4939-2863-7.
More informationSurvey of Local Algorithms
Survey of Local Algorithms JUKKA SUOMELA, University of Helsinki and Helsinki Institute for Information Technology HIIT 4 A local algorithm is a distributed algorithm that runs in constant time, independently
More informationIntroduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/18/14
600.363 Introduction to Algorithms / 600.463 Algorithms I Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/18/14 23.1 Introduction We spent last week proving that for certain problems,
More informationDistributed algorithms for weighted problems in sparse graphs
Distributed algorithms for weighted problems in sparse graphs A. Czygrinow, M. Hańćkowiak June 2, 2005 Abstract We study distributed algorithms for three graph-theoretic problems in weighted trees and
More informationTraveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R + Goal: find a tour (Hamiltonian cycle) of minimum cost
Traveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R + Goal: find a tour (Hamiltonian cycle) of minimum cost Traveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R
More informationLCL problems on grids
LCL problems on grids Sebastian Brandt sebastian.brandt@tik.ee.ethz.ch ETH Zürich Juho Hirvonen juho.hirvonen@aalto.fi IRIF, CNRS and University Paris Diderot Janne H. Korhonen janne.h.korhonen@aalto.fi
More informationIn this paper we consider probabilistic algorithms for that task. Each processor is equipped with a perfect source of randomness, and the processor's
A lower bound on probabilistic algorithms for distributive ring coloring Moni Naor IBM Research Division Almaden Research Center San Jose, CA 9510 Abstract Suppose that n processors are arranged in a ring
More informationLower bounds for maximal matchings and maximal independent sets
arxiv:90.044v [cs.dc] 8 Jan 09 Lower bounds for maximal matchings and maximal independent sets Alkida Balliu alkida.balliu@aalto.fi Aalto University Sebastian Brandt brandts@ethz.ch ETH Zurich Juho Hirvonen
More informationThink Global Act Local
Think Global Act Local Roger Wattenhofer ETH Zurich Distributed Computing www.disco.ethz.ch Town Planning Patrick Geddes Architecture Buckminster Fuller Computer Architecture Caching Robot Gathering e.g.,
More informationExploiting Locality in Distributed SDN Control. Stefan Schmid (TU Berlin & T-Labs) Jukka Suomela (Uni Helsinki)
Exploiting Locality in Distributed SDN Control Stefan Schmid (TU Berlin & T-Labs) Jukka Suomela (Uni Helsinki) 1 My view of SDN before I met Marco and Dan 2 Stefan Schmid (T-Labs) Logically Centralized,
More informationMinimum Dominating Set Approximation in Graphs of Bounded Arboricity
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity Christoph Lenzen and Roger Wattenhofer Computer Engineering and Networks Laboratory (TIK) ETH Zurich {lenzen,wattenhofer}@tik.ee.ethz.ch
More informationLocal algorithms. Lenzen, Christoph. Springer-Verlag 2009
https://helda.helsinki.fi Local algorithms Lenzen, Christoph Springer-Verlag 2009 Lenzen, C, Suomela, J & Wattenhofer, R 2009, Local algorithms : Self-stabilization on speed. in R Guerraoui & F Petit (eds),
More informationThe Power of Orientation in Symmetry-Breaking
2010 24th IEEE International Conference on Advanced Information Networking and Applications The Power of Orientation in Symmetry-Breaking Satya Krishna Pindiproli and Kishore Kothapalli Center for Security,
More informationApproximation Algorithms
Approximation Algorithms Frédéric Giroire FG Simplex 1/11 Motivation Goal: Find good solutions for difficult problems (NP-hard). Be able to quantify the goodness of the given solution. Presentation of
More informationGraph Theory and Optimization Approximation Algorithms
Graph Theory and Optimization Approximation Algorithms Nicolas Nisse Université Côte d Azur, Inria, CNRS, I3S, France October 2018 Thank you to F. Giroire for some of the slides N. Nisse Graph Theory and
More information/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/27/18
601.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/27/18 22.1 Introduction We spent the last two lectures proving that for certain problems, we can
More informationIntroduction to Graph Theory
Introduction to Graph Theory Tandy Warnow January 20, 2017 Graphs Tandy Warnow Graphs A graph G = (V, E) is an object that contains a vertex set V and an edge set E. We also write V (G) to denote the vertex
More informationOn the Probe Complexity of Local Computation Algorithms
On the Probe Complexity of Local Computation Algorithms Uriel Feige Boaz Patt-Shamir Shai Vardi March 23, 2017 arxiv:1703.07734v1 [cs.ds] 22 Mar 2017 Abstract The Local Computation Algorithms (LCA) model
More informationWeek 5. Convex Optimization
Week 5. Convex Optimization Lecturer: Prof. Santosh Vempala Scribe: Xin Wang, Zihao Li Feb. 9 and, 206 Week 5. Convex Optimization. The convex optimization formulation A general optimization problem is
More informationDD2451 Parallel and Distributed Computing --- FDD3008 Distributed Algorithms
DD2451 Parallel and Distributed Computing --- FDD3008 Distributed Algorithms Lecture 8 Leader Election Mads Dam Autumn/Winter 2011 Previously... Consensus for message passing concurrency Crash failures,
More informationFinite Math Linear Programming 1 May / 7
Linear Programming Finite Math 1 May 2017 Finite Math Linear Programming 1 May 2017 1 / 7 General Description of Linear Programming Finite Math Linear Programming 1 May 2017 2 / 7 General Description of
More informationImproved Distributed Degree Splitting and Edge Coloring
Improved Distributed Degree Splitting and Edge Coloring arxiv:1706.04746v1 [cs.dc] 15 Jun 2017 Mohsen Ghaffari ETH Zurich ghaffari@inf.ethz.ch Juho Hirvonen IRIF, CNRS, and University Paris Diderot juho.hirvonen@irif.fr
More informationCOMP Analysis of Algorithms & Data Structures
COMP 3170 - Analysis of Algorithms & Data Structures Shahin Kamali Approximation Algorithms CLRS 35.1-35.5 University of Manitoba COMP 3170 - Analysis of Algorithms & Data Structures 1 / 30 Approaching
More informationGraph Theory S 1 I 2 I 1 S 2 I 1 I 2
Graph Theory S I I S S I I S Graphs Definition A graph G is a pair consisting of a vertex set V (G), and an edge set E(G) ( ) V (G). x and y are the endpoints of edge e = {x, y}. They are called adjacent
More informationDistributed Minimum Dominating Set Approximations in Restricted Families of Graphs
Distributed Computing manuscript No. (will be inserted by the editor) Distributed Minimum Dominating Set Approximations in Restricted Families of Graphs Christoph Lenzen Yvonne-Anne Pignolet Roger Wattenhofer
More informationConstant-Time Local Computation Algorithms
Noname manuscript No. (will be inserted by the editor) Constant-Time Local Computation Algorithms Yishay Mansour Boaz Patt-Shamir Shai Vardi Abstract Local computation algorithms (LCAs) produce small parts
More informationChapter 8 DOMINATING SETS
Chapter 8 DOMINATING SETS Distributed Computing Group Mobile Computing Summer 2004 Overview Motivation Dominating Set Connected Dominating Set The Greedy Algorithm The Tree Growing Algorithm The Marking
More informationGraphs: Introduction. Ali Shokoufandeh, Department of Computer Science, Drexel University
Graphs: Introduction Ali Shokoufandeh, Department of Computer Science, Drexel University Overview of this talk Introduction: Notations and Definitions Graphs and Modeling Algorithmic Graph Theory and Combinatorial
More informationChapter 8 DOMINATING SETS
Distributed Computing Group Chapter 8 DOMINATING SETS Mobile Computing Summer 2004 Overview Motivation Dominating Set Connected Dominating Set The Greedy Algorithm The Tree Growing Algorithm The Marking
More informationLecture Notes: Euclidean Traveling Salesman Problem
IOE 691: Approximation Algorithms Date: 2/6/2017, 2/8/2017 ecture Notes: Euclidean Traveling Salesman Problem Instructor: Viswanath Nagarajan Scribe: Miao Yu 1 Introduction In the Euclidean Traveling Salesman
More informationCMPSCI611: Approximating SET-COVER Lecture 21
CMPSCI611: Approximating SET-COVER Lecture 21 Today we look at two more examples of approximation algorithms for NP-hard optimization problems. The first, for the SET-COVER problem, has an approximation
More informationClustering: Centroid-Based Partitioning
Clustering: Centroid-Based Partitioning Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong 1 / 29 Y Tao Clustering: Centroid-Based Partitioning In this lecture, we
More informationToday. Types of graphs. Complete Graphs. Trees. Hypercubes.
Today. Types of graphs. Complete Graphs. Trees. Hypercubes. Complete Graph. K n complete graph on n vertices. All edges are present. Everyone is my neighbor. Each vertex is adjacent to every other vertex.
More informationDistributed approximation algorithms in unit-disk graphs
Distributed approximation algorithms in unit-disk graphs A. Czygrinow 1 and M. Hańćkowiak 2 1 Department of Mathematics and Statistics Arizona State University Tempe, AZ 85287-1804, USA andrzej@math.la.asu.edu
More informationThroughout this course, we use the terms vertex and node interchangeably.
Chapter Vertex Coloring. Introduction Vertex coloring is an infamous graph theory problem. It is also a useful toy example to see the style of this course already in the first lecture. Vertex coloring
More informationDecomposing Coverings and the Planar Sensor Cover Problem
Intro. previous work. Restricted Strip Cover Decomposing Multiple Coverings Decomposing Coverings and the Planar Sensor Cover Problem Matt Gibson Kasturi Varadarajan presented by Niv Gafni 2012-12-12 Intro.
More informationCONTENTS Equivalence Classes Partition Intersection of Equivalence Relations Example Example Isomorphis
Contents Chapter 1. Relations 8 1. Relations and Their Properties 8 1.1. Definition of a Relation 8 1.2. Directed Graphs 9 1.3. Representing Relations with Matrices 10 1.4. Example 1.4.1 10 1.5. Inverse
More informationGraphs (MTAT , 6 EAP) Lectures: Mon 14-16, hall 404 Exercises: Wed 14-16, hall 402
Graphs (MTAT.05.080, 6 EAP) Lectures: Mon 14-16, hall 404 Exercises: Wed 14-16, hall 402 homepage: http://courses.cs.ut.ee/2012/graafid (contains slides) For grade: Homework + three tests (during or after
More information1 Better Approximation of the Traveling Salesman
Stanford University CS261: Optimization Handout 4 Luca Trevisan January 13, 2011 Lecture 4 In which we describe a 1.5-approximate algorithm for the Metric TSP, we introduce the Set Cover problem, observe
More informationCS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK
CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1 UNIT I INTRODUCTION CS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK 1. Define Graph. 2. Define Simple graph. 3. Write few problems
More informationDistributed Computing over Communication Networks: Leader Election
Distributed Computing over Communication Networks: Leader Election Motivation Reasons for electing a leader? Reasons for not electing a leader? Motivation Reasons for electing a leader? Once elected, coordination
More informationOn the Power of Preprocessing in Decentralized Network Optimization
On the Power of Preprocessing in Decentralized Network Optimization Klaus-Tycho Foerster University of Vienna, Austria Juho Hirvonen Aalto University, Finland Stefan Schmid University of Vienna, Austria
More informationTrees and Tree Encodings
Trees and Tree Encodings January, 08 Introduction: Today, we are going to be looking at a special class of graph theory called trees. These structures are an important discipline in mathematics and have
More informationWUCT121. Discrete Mathematics. Graphs
WUCT121 Discrete Mathematics Graphs WUCT121 Graphs 1 Section 1. Graphs 1.1. Introduction Graphs are used in many fields that require analysis of routes between locations. These areas include communications,
More informationProblem 1.1 (Vertex Coloring). Given an undirected graph G = (V, E), assign a color c v to each vertex v V such that the following holds: e = (v, w)
Chapter 1 Vertex Coloring Vertex coloring is an infamous graph theory problem. It is also a useful toy example to see the style of this course already in the first lecture. Vertex coloring does have quite
More informationLocal Constraints in Combinatorial Optimization
Local Constraints in Combinatorial Optimization Madhur Tulsiani Institute for Advanced Study Local Constraints in Approximation Algorithms Linear Programming (LP) or Semidefinite Programming (SDP) based
More information1 Matchings in Graphs
Matchings in Graphs J J 2 J 3 J 4 J 5 J J J 6 8 7 C C 2 C 3 C 4 C 5 C C 7 C 8 6 J J 2 J 3 J 4 J 5 J J J 6 8 7 C C 2 C 3 C 4 C 5 C C 7 C 8 6 Definition Two edges are called independent if they are not adjacent
More informationEndomorphisms and synchronization, 2: Graphs and transformation monoids
Endomorphisms and synchronization, 2: Graphs and transformation monoids Peter J. Cameron BIRS, November 2014 Relations and algebras Given a relational structure R, there are several similar ways to produce
More informationLecture 4: September 11, 2003
Algorithmic Modeling and Complexity Fall 2003 Lecturer: J. van Leeuwen Lecture 4: September 11, 2003 Scribe: B. de Boer 4.1 Overview This lecture introduced Fixed Parameter Tractable (FPT) problems. An
More informationGraphs and Algorithms 2016
Graphs and Algorithms 2016 Teachers: Nikhil Bansal and Jesper Nederlof TA: Shashwat Garg (Office Hours: Thursday: Pick??) Webpage: www.win.tue.nl/~nikhil/courses/2wo08 (for up to date information, links
More informationMONI NAOR y AND LARRY STOCKMEYER z
WHAT CAN BE COMPUTED LOCALLY? MONI NAOR y AND LARRY STOCKMEYER z Abstract. The purpose of this paper is a study of computation that can be done locally in a distributed network, where \locally" means within
More informationVertex cuts and group splittings. Bernhard Krön
Vertex cuts and group splittings XXI Escola de Algebra 2010 Bernhard Krön University of Vienna, Austria joint with Martin J. Dunwoody, Univ. of Southampton, UK Bernhard Krön (Univ. of Vienna) Vertex cuts
More informationLecture 11: The PRAM Model
Comp 260: Advanced Algorithms Tufts University, Spring 2016 Prof. Lenore Cowen Scribe: Zhuting Xue Lecture 11: The PRAM Model 1 Basic Notations The PRAM stands for Parallel Random Access Machine, where
More informationLecture 10 October 7, 2014
6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Lecture 10 October 7, 2014 Prof. Erik Demaine Scribes: Fermi Ma, Asa Oines, Mikhail Rudoy, Erik Waingarten Overview This lecture begins
More informationPart II. Graph Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 53 Paper 3, Section II 15H Define the Ramsey numbers R(s, t) for integers s, t 2. Show that R(s, t) exists for all s,
More informationSymmetry breaking depending on the chromatic number or the neighborhood growth
Accepted Manuscript Symmetry breaking depending on the chromatic number or the neighborhood growth Johannes Schneider, Michael Elkin, Roger Wattenhofer PII: S0304-3975(12)00824-9 DOI: 10.1016/j.tcs.2012.09.004
More informationApproximation Algorithms
Approximation Algorithms Group Members: 1. Geng Xue (A0095628R) 2. Cai Jingli (A0095623B) 3. Xing Zhe (A0095644W) 4. Zhu Xiaolu (A0109657W) 5. Wang Zixiao (A0095670X) 6. Jiao Qing (A0095637R) 7. Zhang
More informationOn some problems in graph theory: from colourings to vertex identication
On some problems in graph theory: from colourings to vertex identication F. Foucaud 1 Joint works with: E. Guerrini 1,2, R. Klasing 1, A. Kosowski 1,3, M. Kov²e 1,2, R. Naserasr 1, A. Parreau 2, A. Raspaud
More information15-451/651: Design & Analysis of Algorithms November 4, 2015 Lecture #18 last changed: November 22, 2015
15-451/651: Design & Analysis of Algorithms November 4, 2015 Lecture #18 last changed: November 22, 2015 While we have good algorithms for many optimization problems, the previous lecture showed that many
More informationVertex Coloring. Lecture The Problem. next previous size data
Lecture 1 Vertex Coloring 1.1 The Problem Nowadays multi-core computers get more and more processors, and the question is how to handle all this parallelism well. So, here s a basic problem: Consider a
More informationLecture 16: Gaps for Max-Cut
Advanced Approximation Algorithms (CMU 8-854B, Spring 008) Lecture 6: Gaps for Max-Cut Mar 6, 008 Lecturer: Ryan O Donnell Scribe: Ravishankar Krishnaswamy Outline In this lecture, we will discuss algorithmic
More informationOn the Probe Complexity of Local Computation Algorithms
On the Probe Complexity of Local Computation Algorithms Uriel Feige 1 Weizmann Institute of Science, Rehovot, Israel uriel.feige@weizmann.ac.il Boaz Patt-Shamir 2 Tel Aviv University, Tel Aviv, Israel
More informationIndependent dominating sets in graphs of girth five via the semi-random method
Independent dominating sets in graphs of girth five via the semi-random method Ararat Harutyunyan (Oxford), Paul Horn (Harvard), Jacques Verstraete (UCSD) March 12, 2014 Introduction: The semi-random method
More informationProduct constructions for transitive decompositions of graphs
116 Product constructions for transitive decompositions of graphs Geoffrey Pearce Abstract A decomposition of a graph is a partition of the edge set, giving a set of subgraphs. A transitive decomposition
More informationarxiv: v3 [cs.dc] 17 May 2018
Round- and Message-Optimal Distributed Graph Algorithms Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc Carnegie Mellon University, {haeupler,dhershko,dwajc}@cs.cmu.edu arxiv:1801.05127v3 [cs.dc] 17
More information1 The Traveling Salesperson Problem (TSP)
CS 598CSC: Approximation Algorithms Lecture date: January 23, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im In the previous lecture, we had a quick overview of several basic aspects of approximation
More informationAssignment 4 Solutions of graph problems
Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of
More informationThe Power of Locality
GIAN Course on Distributed Network Algorithms The Power of Locality Case Study: Graph Coloring Stefan Schmid @ T-Labs, 2011 Case Study: Graph Coloring Case Study: Graph Coloring Assign colors to nodes.
More informationNP-Completeness. Algorithms
NP-Completeness Algorithms The NP-Completeness Theory Objective: Identify a class of problems that are hard to solve. Exponential time is hard. Polynomial time is easy. Why: Do not try to find efficient
More information: Parallel Algorithms Exercises, Batch 1. Exercise Day, Tuesday 18.11, 10:00. Hand-in before or at Exercise Day
184.727: Parallel Algorithms Exercises, Batch 1. Exercise Day, Tuesday 18.11, 10:00. Hand-in before or at Exercise Day Jesper Larsson Träff, Francesco Versaci Parallel Computing Group TU Wien October 16,
More informationComputing Hyperplanes of Near Polygons
of Near Polygons (joint work with Bart De Bruyn) Ghent University anurag.2357@gmail.com CoCoA 2015 - Combinatorics and Computer Algebra Near polygons A near 2d-gon is a graph of diameter d in which for
More informationGroups and Graphs Lecture I: Cayley graphs
Groups and Graphs Lecture I: Cayley graphs Vietri, 6-10 giugno 2016 Groups and Graphs Lecture I: Cayley graphs Vietri, 6-10 giugno 2016 1 / 17 graphs A GRAPH is a pair Γ = (V, E) where V - set of vertices
More informationLinear Programming in Small Dimensions
Linear Programming in Small Dimensions Lekcija 7 sergio.cabello@fmf.uni-lj.si FMF Univerza v Ljubljani Edited from slides by Antoine Vigneron Outline linear programming, motivation and definition one dimensional
More informationPrimal-Dual Based Distributed Algorithms for Vertex Cover with Semi-Hard Capacities
Primal-Dual Based Distributed Algorithms for Vertex Cover with Semi-Hard Capacities F. Grandoni Informatica, Università di Roma La Sapienza Via Salaria 3 0098 Roma, Italy grandoni@di.uniroma.it J. Könemann
More informationVertex Coloring. Chapter Problem & Model 6 CHAPTER 1. VERTEX COLORING. Figure 1.2: 3-colorable graph with a valid coloring.
6 CHAPTER 1. VERTEX COLORING 1 2 Chapter 1 Vertex Coloring Vertex coloring is an infamous graph theory problem. It is also a useful toy example to see the style of this course already in the first lecture.
More informationA List Heuristic for Vertex Cover
A List Heuristic for Vertex Cover Happy Birthday Vasek! David Avis McGill University Tomokazu Imamura Kyoto University Operations Research Letters (to appear) Online: http://cgm.cs.mcgill.ca/ avis revised:
More informationThe Round Complexity of Distributed Sorting
The Round Complexity of Distributed Sorting by Boaz Patt-Shamir Marat Teplitsky Tel Aviv University 1 Motivation Distributed sorting Infrastructure is more and more distributed Cloud Smartphones 2 CONGEST
More informationOn the packing chromatic number of some lattices
On the packing chromatic number of some lattices Arthur S. Finbow Department of Mathematics and Computing Science Saint Mary s University Halifax, Canada BH C art.finbow@stmarys.ca Douglas F. Rall Department
More informationDigraph Complexity Measures and Applications in Formal Language Theory
Digraph Complexity Measures and by Hermann Gruber Institut für Informatik Justus-Liebig-Universität Giessen Germany November 14, 2008 Overview 1 Introduction and Motivation 2 3 4 5 Outline Introduction
More informationGeometric Routing: Of Theory and Practice
Geometric Routing: Of Theory and Practice PODC 03 F. Kuhn, R. Wattenhofer, Y. Zhang, A. Zollinger [KWZ 02] [KWZ 03] [KK 00] Asymptotically Optimal Geometric Mobile Ad-Hoc Routing Worst-Case Optimal and
More informationMath 575 Exam 3. (t). What is the chromatic number of G?
Math 575 Exam 3 Name 1 (a) Draw the Grötsch graph See your notes (b) Suppose that G is a graph having 6 vertices and 9 edges and that the chromatic polynomial of G is given below Fill in the missing coefficients
More information/ Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang
600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang 9.1 Linear Programming Suppose we are trying to approximate a minimization
More informationDecision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes Florent Foucaud a,b,c a Department of Mathematics, University of Johannesburg, Johannesburg
More informationLecture 7: Asymmetric K-Center
Advanced Approximation Algorithms (CMU 18-854B, Spring 008) Lecture 7: Asymmetric K-Center February 5, 007 Lecturer: Anupam Gupta Scribe: Jeremiah Blocki In this lecture, we will consider the K-center
More information