Matches in SemOpenAlex for { <https://semopenalex.org/work/W4321321036> ?p ?o ?g. }
Showing items 1 to 67 of
67
with 100 items per page.
- W4321321036 abstract "Given a set of $n$ points on a plane, in the Minimum Weight Triangulation problem, we wish to find a triangulation that minimizes the sum of Euclidean length of its edges. This incredibly challenging problem has been studied for more than four decades and has been only recently shown to be NP-Hard. In this paper we present a novel polynomial-time algorithm that computes a $14$-approximation of the minimum weight triangulation -- a constant that is significantly smaller than what has been previously known. In our algorithm, we use grids to partition the edges into levels where shorter edges appear at smaller levels and edges with similar lengths appear at the same level. We then triangulate the point set incrementally by introducing edges in increasing order of their levels. We introduce the edges of any level $i+1$ in two steps. In the first step, we add edges using a variant of the well-known ring heuristic to generate a partial triangulation $hat{mathcal{A}}_i$. In the second step, we greedily add non-intersecting level $i+1$ edges to $hat{mathcal{A}}_i$ in increasing order of their length and obtain a partial triangulation $mathcal{A}_{ i+1}$. The ring heuristic is known to yield only an $O(log n)$-approximation even for a convex polygon and the greedy heuristic achieves only a $Theta(sqrt{n})$-approximation. Therefore, it is surprising that their combination leads to an improved approximation ratio of $14$. For the proof, we identify several useful properties of $hat{mathcal{A}}_i$ and combine it with a new Euler characteristic based technique to show that $hat{mathcal{A}}_i$ has more edges than $mathcal{T}_i$; here $mathcal{T}_i$ is the partial triangulation consisting of level $le i$ edges of some minimum weight triangulation. We then use a simple greedy stays ahead proof strategy to bound the approximation ratio." @default.
- W4321321036 created "2023-02-19" @default.
- W4321321036 creator A5034579450 @default.
- W4321321036 creator A5060151892 @default.
- W4321321036 date "2017-06-10" @default.
- W4321321036 modified "2023-09-29" @default.
- W4321321036 title "A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem" @default.
- W4321321036 doi "https://doi.org/10.48550/arxiv.1706.03263" @default.
- W4321321036 hasPublicationYear "2017" @default.
- W4321321036 type Work @default.
- W4321321036 citedByCount "0" @default.
- W4321321036 crossrefType "posted-content" @default.
- W4321321036 hasAuthorship W4321321036A5034579450 @default.
- W4321321036 hasAuthorship W4321321036A5060151892 @default.
- W4321321036 hasBestOaLocation W43213210361 @default.
- W4321321036 hasConcept C112680207 @default.
- W4321321036 hasConcept C11413529 @default.
- W4321321036 hasConcept C114614502 @default.
- W4321321036 hasConcept C121198538 @default.
- W4321321036 hasConcept C126255220 @default.
- W4321321036 hasConcept C129782007 @default.
- W4321321036 hasConcept C135981907 @default.
- W4321321036 hasConcept C148764684 @default.
- W4321321036 hasConcept C173801870 @default.
- W4321321036 hasConcept C24881265 @default.
- W4321321036 hasConcept C2524010 @default.
- W4321321036 hasConcept C2780034980 @default.
- W4321321036 hasConcept C311688 @default.
- W4321321036 hasConcept C33923547 @default.
- W4321321036 hasConcept C39969762 @default.
- W4321321036 hasConcept C42812 @default.
- W4321321036 hasConcept C51823790 @default.
- W4321321036 hasConcept C68010082 @default.
- W4321321036 hasConceptScore W4321321036C112680207 @default.
- W4321321036 hasConceptScore W4321321036C11413529 @default.
- W4321321036 hasConceptScore W4321321036C114614502 @default.
- W4321321036 hasConceptScore W4321321036C121198538 @default.
- W4321321036 hasConceptScore W4321321036C126255220 @default.
- W4321321036 hasConceptScore W4321321036C129782007 @default.
- W4321321036 hasConceptScore W4321321036C135981907 @default.
- W4321321036 hasConceptScore W4321321036C148764684 @default.
- W4321321036 hasConceptScore W4321321036C173801870 @default.
- W4321321036 hasConceptScore W4321321036C24881265 @default.
- W4321321036 hasConceptScore W4321321036C2524010 @default.
- W4321321036 hasConceptScore W4321321036C2780034980 @default.
- W4321321036 hasConceptScore W4321321036C311688 @default.
- W4321321036 hasConceptScore W4321321036C33923547 @default.
- W4321321036 hasConceptScore W4321321036C39969762 @default.
- W4321321036 hasConceptScore W4321321036C42812 @default.
- W4321321036 hasConceptScore W4321321036C51823790 @default.
- W4321321036 hasConceptScore W4321321036C68010082 @default.
- W4321321036 hasLocation W43213210361 @default.
- W4321321036 hasOpenAccess W4321321036 @default.
- W4321321036 hasPrimaryLocation W43213210361 @default.
- W4321321036 hasRelatedWork W1507123436 @default.
- W4321321036 hasRelatedWork W1568423349 @default.
- W4321321036 hasRelatedWork W1604723982 @default.
- W4321321036 hasRelatedWork W1975166674 @default.
- W4321321036 hasRelatedWork W2045672216 @default.
- W4321321036 hasRelatedWork W2072698009 @default.
- W4321321036 hasRelatedWork W2087855749 @default.
- W4321321036 hasRelatedWork W2198068433 @default.
- W4321321036 hasRelatedWork W2368353614 @default.
- W4321321036 hasRelatedWork W2949530180 @default.
- W4321321036 isParatext "false" @default.
- W4321321036 isRetracted "false" @default.
- W4321321036 workType "article" @default.