On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full SODA 2012 / arxiv.org.

Slides:



Advertisements
Similar presentations
The Primal-Dual Method: Steiner Forest TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A AA A A A AA A A.
Advertisements

Filling Algorithms Pixelwise MRFsChaos Mosaics Patch segments are pasted, overlapping, across the image. Then either: Ambiguities are removed by smoothing.
Approximation algorithms for geometric intersection graphs.
Approximation Algorithms Chapter 14: Rounding Applied to Set Cover.
Lecture 24 Coping with NPC and Unsolvable problems. When a problem is unsolvable, that's generally very bad news: it means there is no general algorithm.
Dragan Jovicic Harvinder Singh
Approximation Algorithms for Capacitated Set Cover Ravishankar Krishnaswamy (joint work with Nikhil Bansal and Barna Saha)
Approximating Maximum Subgraphs Without Short Cycles Guy Kortsarz Join work with Michael Langberg and Zeev Nutov.
S. J. Shyu Chap. 1 Introduction 1 The Design and Analysis of Algorithms Chapter 1 Introduction S. J. Shyu.
How should we define corner points? Under any reasonable definition, point x should be considered a corner point x What is a corner point?
Combinatorial Algorithms
CS774. Markov Random Field : Theory and Application Lecture 17 Kyomin Jung KAIST Nov
The Stackelberg Minimum Spanning Tree Game Jean Cardinal · Erik D. Demaine · Samuel Fiorini · Gwenaël Joret · Stefan Langerman · Ilan Newman · OrenWeimann.
Computational problems, algorithms, runtime, hardness
Approximation Algorithms
1 Optimization problems such as MAXSAT, MIN NODE COVER, MAX INDEPENDENT SET, MAX CLIQUE, MIN SET COVER, TSP, KNAPSACK, BINPACKING do not have a polynomial.
Approximation Algorithm: Iterative Rounding Lecture 15: March 9.
Implicit Hitting Set Problems Richard M. Karp Harvard University August 29, 2011.
A general approximation technique for constrained forest problems Michael X. Goemans & David P. Williamson Presented by: Yonatan Elhanani & Yuval Cohen.
1 Vertex Cover Problem Given a graph G=(V, E), find V' ⊆ V such that for each edge (u, v) ∈ E at least one of u and v belongs to V’ and |V’| is minimized.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Spring, 2006 Lecture 7 Monday, 4/3/06 Approximation Algorithms.
Job Scheduling Lecture 19: March 19. Job Scheduling: Unrelated Multiple Machines There are n jobs, each job has: a processing time p(i,j) (the time to.
On Stochastic Minimum Spanning Trees Kedar Dhamdhere Computer Science Department Joint work with: Mohit Singh, R. Ravi (IPCO 05)
Integer Programming Difference from linear programming –Variables x i must take on integral values, not real values Lots of interesting problems can be.
Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy under contract.
1 University of Denver Department of Mathematics Department of Computer Science.
Traversing the Machining Graph Danny Chen, Notre Dame Rudolf Fleischer, Li Jian, Wang Haitao,Zhu Hong, Fudan Sep,2006.
1 Introduction to Approximation Algorithms Lecture 15: Mar 5.
Finding a maximum independent set in a sparse random graph Uriel Feige and Eran Ofek.
Quadtrees and Mesh Generation Student Lecture in course MATH/CSC 870 Philipp Richter Thursday, April 19 th, 2007.
Packing Element-Disjoint Steiner Trees Mohammad R. Salavatipour Department of Computing Science University of Alberta Joint with Joseph Cheriyan Department.
Approximation Algorithms: Bristol Summer School 2008 Seffi Naor Computer Science Dept. Technion Haifa, Israel TexPoint fonts used in EMF. Read the TexPoint.
The Art Gallery Problem
Outline Introduction The hardness result The approximation algorithm.
1 The TSP : NP-Completeness Approximation and Hardness of Approximation All exact science is dominated by the idea of approximation. -- Bertrand Russell.
Approximating Minimum Bounded Degree Spanning Tree (MBDST) Mohit Singh and Lap Chi Lau “Approximating Minimum Bounded DegreeApproximating Minimum Bounded.
1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.
Advanced Algorithm Design and Analysis (Lecture 13) SW5 fall 2004 Simonas Šaltenis E1-215b
Approximation Algorithms for Knapsack Problems 1 Tsvi Kopelowitz Modified by Ariel Rosenfeld.
Week 10Complexity of Algorithms1 Hard Computational Problems Some computational problems are hard Despite a numerous attempts we do not know any efficient.
Approximation algorithms for TSP with neighborhoods in the plane R 郭秉鈞 R 林傳健.
Princeton University COS 423 Theory of Algorithms Spring 2001 Kevin Wayne Approximation Algorithms These lecture slides are adapted from CLRS.
On Graphs Supporting Greedy Forwarding for Directional Wireless Networks W. Si, B. Scholz, G. Mao, R. Boreli, et al. University of Western Sydney National.
CSE 589 Part VI. Reading Skiena, Sections 5.5 and 6.8 CLR, chapter 37.
NP-COMPLETE PROBLEMS. Admin  Two more assignments…  No office hours on tomorrow.
NP-Complete problems.
Implicit Hitting Set Problems Richard M. Karp Erick Moreno Centeno DIMACS 20 th Anniversary.
CPS Computational problems, algorithms, runtime, hardness (a ridiculously brief introduction to theoretical computer science) Vincent Conitzer.
1 Approximation algorithms Algorithms and Networks 2015/2016 Hans L. Bodlaender Johan M. M. van Rooij TexPoint fonts used in EMF. Read the TexPoint manual.
Algorithms for hard problems Introduction Juris Viksna, 2015.
Minimum Weight Triangulation Plamen Ivanov Problem 1 from The Open Problems Project
Unfolding and Reconstructing Polyhedra Brendan Lucier University of Waterloo Master’s Thesis Presentation University of Waterloo, Waterloo, Ontario January.
Models of Greedy Algorithms for Graph Problems Sashka Davis, UCSD Russell Impagliazzo, UCSD SIAM SODA 2004.
Ion I. Mandoiu, Vijay V. Vazirani Georgia Tech Joseph L. Ganley Simplex Solutions A New Heuristic for Rectilinear Steiner Trees.
1 CS270 Project Overview Maximum Planar Subgraph Danyel Fisher Jason Hong Greg Lawrence Jimmy Lin.
Approximation Algorithms based on linear programming.
Polygon Triangulation
Approximation algorithms
On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside February 2012.
Approximation Algorithms
Approximation algorithms
Polynomial-time approximation schemes for NP-hard geometric problems
Possibilities and Limitations in Computation
The Art Gallery Problem
Linear Programming CISC4080, Computer Algorithms CIS, Fordham Univ.
CISC5835, Algorithms for Big Data
Approximating Points by A Piecewise Linear Function: I
5.4 T-joins and Postman Problems
the k-cut problem better approximate and exact algorithms
The Complexity of Approximation
Presentation transcript:

On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full SODA 2012 / arxiv.org

min-weight triangulation of a simple polygon

dynamic programming O(n 3 ) time

min-weight triangulation of a simple polygon dynamic programming O(n 3 ) time

min-weight triangulation of a simple polygon dynamic programming O(n 3 ) time

X min-weight triangulation of a simple polygon dynamic programming O(n 3 ) time

X min-weight triangulation of a simple polygon dynamic programming O(n 3 ) time

min-weight triangulation of a simple polygon dynamic programming O(n 3 ) time

[1979] Gilbert. New results on planar triangulations. [1980] Klincsek. Minimal triangulations of polygonal domains. dynamic programming O(n 3 ) time min-weight triangulation of a simple polygon

minimum weight triangulation (MWT) input: a set of points in the plane: output :

minimum weight triangulation (MWT) input: a set of points in the plane: output : a triangulation T

minimum weight triangulation (MWT) input: a set of points in the plane: output : a triangulation T of minimum weight,

the Bible (1979)

MWT NP-Hard? In P?

approximation algorithms [1987] Plaisted and Hong. O(log n)-approx A heuristic triangulation algorithm. [1996] Levcopoulos and Krznaric. O(1)-approx Quasi-greedy triangulations approximating the minimum weight triangulation. [2006] Remy and Steger. QPTAS A quasi-polynomial time approximation scheme for minimum weight triangulation. hardness result [2006] Mulzer and Rote. 25 years after G+J! NP-HARD Minimum weight triangulation is NP-hard.

heuristics! edges that can’t be in any MWT: diamond test [1989 Das and Joseph; 2001 Drysdale et al.] a b

heuristics! edges that can’t be in any MWT: diamond test [1989 Das and Joseph; 2001 Drysdale et al.] a π/4.6 b

edges that can’t be in any MWT: diamond test [1989 Das and Joseph; 2001 Drysdale et al.] edges that have to be in every MWT: mutual nearest neighbors [1979 Gilbert; 1994 Yang et al] β-skeleton [1993 Keil; 1995 Yang; 1996 Cheng and Xu] locally minimal triangulation (“LMT-skeleton”) [1997 Dickerson et al; 1998 Beirouti and Snoeyink; 1996 Cheng et al; 1999 Aichholzer et al; 1996 Belleville et al; 2002 Bose et al] a π/4.6 b heuristics!

1. The boundary edges have to be in the MWT.

heuristics! 2. Use the heuristics to find more edges that have to be in the MWT.

heuristics! if you’re lucky... found edges connect all points to boundary. Then remaining regions are simple polygons.

heuristics! 3. Triangulate each remaining region optimally using the dynamic-programming algorithm.

heuristics! 3. Triangulate each remaining region optimally using the dynamic-programming algorithm.

This approach solves most random 40,000-point instances. [Dickerson et al. '97] But.. for random instances, heuristics leave (in expectation) Ω(n) internal components (but hidden constant is astronomically small, ). [Bose et al. '02] heuristics

linear programs for MWT [1985] Dantzig et al. Triangulations (tilings) and certain block triangular matrices. Subsequently studied in [1996 Loera et al; 2004 Kirsanov, etc...] edge-based linear programs: [1997] Kyoda et al. A branch-and-cut approach for minimum weight triangulation. [1996] Kyoda. A study of generating minimum weight triangulation within practical time. [1996] Ono et al. A package for triangulations. [1998] Tajima. Optimality and integer programming formulations of triangulations in general dimension. [2000] Aurenhammer and Xu. Optimal triangulations.

Dantzig et al’s triangle-based LP [1985] minimize subject to

Dantzig et al’s triangle-based LP [1985] minimize subject to

Dantzig et al’s triangle-based LP [1985] minimize subject to

Dantzig et al’s triangle-based LP [1985] minimize subject to

Dantzig et al’s triangle-based LP [1985] minimize subject to

Dantzig et al’s triangle-based LP [1985] minimize subject to

Dantzig et al’s triangle-based LP [1985] minimize subject to Exactly one of these triangles must be in the triangulation. “Exact cover by triangles.”

Integer vs. fractional MWT Fractional MWT Each triangle has weight 1/2 Integer MWT

Integer vs. fractional MWT Fractional MWT Each triangle has weight 1/2 Integer MWT

Integer vs. fractional MWT Fractional MWT Each triangle has weight 1/2 Integer MWT

Integer vs. fractional MWT Fractional MWT Each triangle has weight 1/2 Integer MWT

Integer vs. fractional MWT Fractional MWT Each triangle has weight 1/2 Integer MWT

Integer vs. fractional MWT Fractional MWT Each triangle has weight 1/2 Integer MWT

Integer vs. fractional MWT Fractional MWT Each triangle has weight 1/2 Integer MWT

Integer vs. fractional MWT Fractional MWT Each triangle has weight 1/2 Integer MWT

Integer vs. fractional MWT Fractional MWT Each triangle has weight 1/2 Integer MWT

Integer vs. fractional MWT Fractional MWT Each triangle has weight 1/2 Integer MWT

Integer vs. fractional MWT Fractional MWT Each triangle has weight 1/2 Integer MWT

Integer vs. fractional MWT Fractional MWT Each triangle has weight 1/2 Integer MWT

Integer vs. fractional MWT Fractional MWT Each triangle has weight 1/2 Integer MWT

Integer vs. fractional MWT Fractional MWT Each triangle has weight 1/2 Integer MWT Ratio of costs is about 1.001

known results The integrality gap is at least [2004 Kirsanov ] For simple-polygon instances, the LP finds the MWT. [1985 Dantzig et al; 1996 Loera et al; 2004 Kirsanov; etc ]

known results The integrality gap is at least [2004 Kirsanov ] For simple-polygon instances, the LP finds the MWT. [1985 Dantzig et al; 1996 Loera et al; 2004 Kirsanov; etc ] new results THM 1: The integrality gap of the LP is constant. THM 2: If the heuristics find the MWT for a given instance, then so does the LP. (For that instance, each optimal solution to the LP is integer-valued and corresponds to a MWT.)

first new result THM 1: The integrality gap of the LP is constant.

first new result THM 1: The integrality gap of the LP is constant. proof idea: As Levcopoulos and Krznaric [1996] show, their algorithm produces triangulation T of cost at most O(1) times the MWT (optimal integer solution). We show that their triangulation T has cost at most O(1) times the optimal fractional LP solution.

second new result THM 2: If the heuristics find the MWT for a given instance, then so does the LP.

second new result THM 2: If the heuristics find the MWT for a given instance, then so does the LP. proof idea: If a heuristic shows that an edge is not in any MWT, we show that the optimal fractional triangulation cannot use the edge either. If a heuristic shows that an edge is in every MWT, we show that the optimal fractional triangulation must use the edge fully as well. Requires painstakingly adapting each analysis.

X Y Minimum Weight Triangulation (MWT) Fractional Triangulation Most heuristics based on local-improvement arguments. For example, a heuristic might show (x,y) is in every MWT by contradiction. Suppose (x,y) is not in a given triangulation. example

X Y Minimum Weight Triangulation (MWT) Fractional Triangulation Most heuristics based on local-improvement arguments. For example, a heuristic might show (x,y) is in every MWT by contradiction. Suppose (x,y) is not in a given triangulation. Then some triangle in the triangulation must cross (x,y): example

X Y Minimum Weight Triangulation (MWT) Fractional Triangulation Most heuristics based on local-improvement arguments. For example, a heuristic might show (x,y) is in every MWT by contradiction. Suppose (x,y) is not in a given triangulation. Then some triangle in the triangulation must cross (x,y). The triangulation must extend this triangle on each side: example

X Y Minimum Weight Triangulation (MWT) Fractional Triangulation Most heuristics based on local-improvement arguments. For example, a heuristic might show (x,y) is in every MWT by contradiction. Suppose (x,y) is not in a given triangulation. Then some triangle in the triangulation must cross (x,y). Continuing, the triangulation covers (x,y) locally something like this: example

X Y Minimum Weight Triangulation (MWT) Fractional Triangulation Most heuristics based on local-improvement arguments. For example, a heuristic might show (x,y) is in every MWT by contradiction. Suppose (x,y) is not in a given triangulation. One shows that, given the heuristic condition, this triangulation can be improved, contradicting MWT. example

X Y X Y Minimum Weight Triangulation (MWT) Fractional Triangulation Most heuristics based on local-improvement arguments. For example, a heuristic might show (x,y) is in every MWT by contradiction. Suppose (x,y) is not in a given triangulation. One shows that, given the heuristic condition, this subtriangulation can be improved, contradicting MWT. example

X Y Minimum Weight Triangulation (MWT) Fractional Triangulation X Y X Y extending to fractional triangulation example - extending to fractional MWT Assume for contradiction that (x,y) edge is not used fully (with total weight 1) in the fractional MWT. Some triangle that crosses (x,y) must have positive weight.

X Y X Y X Y Minimum Weight Triangulation (MWT) Fractional Triangulation example - extending to fractional MWT extending to fractional triangulation Assume for contradiction that (x,y) edge is not used fully (with total weight 1) in the fractional MWT. Some triangle that crosses (x,y) must have positive weight. Can again find a sub-triangulation over (x,y) with positive wt.

X Y X Y X Y Minimum Weight Triangulation (MWT) Fractional Triangulation example - extending to fractional MWT Assume for contradiction that (x,y) edge is not used fully (with total weight 1) in the fractional MWT. Some triangle that crosses (x,y) must have positive weight. Can again find a sub-triangulation over (x,y) with positive wt. But the triangles covering (x,y) may overlap! Complicates argument, but is not fatal. extending to fractional triangulation

open problems