Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

SODA

2012

ACM

2012

ACM

ABSTRACT∗ Arman Youseﬁ† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of eﬀective polynomialtime heuristics that, for many instances, can ﬁnd the exact MWT. Linear programs (LPs) for MWT are well-studied, but previously no connection was known between any LP and any approximation algorithm or heuristic for MWT. Here we show the ﬁrst such connections: for an LP formulation due to Dantzig et al. (1985): (i) the integrality gap is bounded by a constant; (ii) given any instance, if the aforementioned heuristics ﬁnd the MWT, then so does the LP.

Related Content

Added |
28 Sep 2012 |

Updated |
28 Sep 2012 |

Type |
Journal |

Year |
2012 |

Where |
SODA |

Authors |
Arman Yousefi, Neal E. Young |

Comments (0)