✦ LIBER ✦

A better subgraph of the minimum weight triangulation

✍ Scribed by Yang Bo-Ting

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 269 KB
Volume: 56
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(95)00164-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quasi-Greedy Triangulations Approximatin

Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation

✍ Christos Levcopoulos; Drago Krznaric 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 334 KB

Improved heuristics for the minimum weig

Improved heuristics for the minimum weight triangulation problem

✍ Yinfeng Xu; Dian Zhou 📂 Article 📅 1995 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 638 KB

New results for the minimum weight trian

New results for the minimum weight triangulation problem

✍ L. S. Heath; S. V. Pemmaraju 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 974 KB

Polynomial-time instances of the minimum

Polynomial-time instances of the minimum weight triangulation problem

✍ Efthymios Anagnostou; Derek Corneil 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 882 KB

A new asymmetric inclusion region for mi

A new asymmetric inclusion region for minimum weight triangulation

✍ Shiyan Hu 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 286 KB

A Better Approximation Ratio for the Min

A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem

✍ Cristina G Fernandes 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Consider the minimum size k-edge-connected spanning subgraph problem: given a positive integer k and a k-edge-connected graph G, find a k-edge-connected spanning subgraph of G with the minimum number of edges. This problem is known to be NP-complete. Khuller and Raghavachari presented the first algo