Pages that link to "Item:Q1343467"
From MaRDI portal
The following pages link to New results for the minimum weight triangulation problem (Q1343467):
Displaying 33 items.
- One strike against the min-max degree triangulation problem (Q685602) (← links)
- Steiner reducing sets of minimum weight triangulations: Structure and topology (Q906839) (← links)
- The neutral case for the min-max triangulation (Q915345) (← links)
- Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations (Q1095812) (← links)
- Approximating minimum-weight triangulations in three dimensions (Q1293672) (← links)
- Computing a minimum weight triangulation of a sparse point set (Q1304398) (← links)
- Polynomial-time instances of the minimum weight triangulation problem (Q1314524) (← links)
- Approximating the minimum weight Steiner triangulation (Q1317876) (← links)
- New results for the minimum weight triangulation problem (Q1343467) (← links)
- Drawing outerplanar minimum weight triangulations (Q1351606) (← links)
- A linear-time approximation scheme for minimum weight triangulation of convex polygons (Q1393070) (← links)
- An exact algorithm for the minimum dilation triangulation problem (Q1679486) (← links)
- Improved heuristics for the minimum weight triangulation problem (Q1913901) (← links)
- An almost four-approximation algorithm for maximum weight triangulation (Q2268761) (← links)
- Minimum weight pseudo-triangulations (Q2385693) (← links)
- Fast greedy triangulation algorithms. (Q2482901) (← links)
- The minimum weight triangulation problem with few inner points (Q2495946) (← links)
- Finding a maximum weight triangle in n <sup>3-Δ</sup> time, with applications (Q2931387) (← links)
- Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound (Q2958326) (← links)
- Minimum-weight triangulation is NP-hard (Q3546362) (← links)
- Computing and Combinatorics (Q4681212) (← links)
- A fast heuristic for approximating the minimum weight triangulation (Q5054821) (← links)
- Solving large-scale minimum-weight triangulation instances to provable optimality (Q5115812) (← links)
- Parameterized and Exact Computation (Q5311512) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465862) (← links)
- Minimum weight disk triangulations and fillings (Q5857742) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901269) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901270) (← links)
- On exclusion regions for optimal triangulations (Q5929321) (← links)
- A lower bound for \(\beta\)-skeleton belonging to minimum weight triangulations (Q5943321) (← links)
- On \(\beta\)-skeleton as a subgraph of the minimum weight triangulation (Q5958132) (← links)
- A better subgraph of the minimum weight triangulation (Q6085740) (← links)
- A study of the LMT-skeleton (Q6487445) (← links)