Matches in SemOpenAlex for { <https://semopenalex.org/work/W2395605711> ?p ?o ?g. }
Showing items 1 to 57 of
57
with 100 items per page.
- W2395605711 endingPage "154" @default.
- W2395605711 startingPage "149" @default.
- W2395605711 abstract "Delaunay and Gabriel graphs are widely studied geometric proximity structures. Motivated by applications in wireless routing, relaxed versions of these graphs known as Locally Delaunay Graphs (LDGs) and Locally Gabriel Graphs (LGGs) were proposed. We propose another generalization of LGGs called Generalized Locally Gabriel Graphs (GLGGs) in the context when certain edges are forbidden in the graph. Unlike a Gabriel Graph, there is no unique LGG or GLGG for a given point set because no edge is necessarily included or excluded. This property allows us to choose an LGG/GLGG that optimizes a parameter of interest in the graph. We show that computing an edge maximum GLGG for a given problem instance is NP-hard and also APX-hard. We also show that computing an LGG on a given point set with dilation ≤ k is NP-hard. Finally, we give an algorithm to verify whether a given geometric graph G = (V,E) is a valid LGG." @default.
- W2395605711 created "2016-06-24" @default.
- W2395605711 creator A5062650037 @default.
- W2395605711 creator A5084909127 @default.
- W2395605711 date "2012-01-01" @default.
- W2395605711 modified "2023-10-16" @default.
- W2395605711 title "Hardness Results for Computing Optimal Locally Gabriel Graphs." @default.
- W2395605711 hasPublicationYear "2012" @default.
- W2395605711 type Work @default.
- W2395605711 sameAs 2395605711 @default.
- W2395605711 citedByCount "0" @default.
- W2395605711 crossrefType "proceedings-article" @default.
- W2395605711 hasAuthorship W2395605711A5062650037 @default.
- W2395605711 hasAuthorship W2395605711A5084909127 @default.
- W2395605711 hasConcept C114614502 @default.
- W2395605711 hasConcept C118615104 @default.
- W2395605711 hasConcept C132525143 @default.
- W2395605711 hasConcept C33923547 @default.
- W2395605711 hasConcept C41008148 @default.
- W2395605711 hasConcept C68010082 @default.
- W2395605711 hasConcept C80444323 @default.
- W2395605711 hasConceptScore W2395605711C114614502 @default.
- W2395605711 hasConceptScore W2395605711C118615104 @default.
- W2395605711 hasConceptScore W2395605711C132525143 @default.
- W2395605711 hasConceptScore W2395605711C33923547 @default.
- W2395605711 hasConceptScore W2395605711C41008148 @default.
- W2395605711 hasConceptScore W2395605711C68010082 @default.
- W2395605711 hasConceptScore W2395605711C80444323 @default.
- W2395605711 hasLocation W23956057111 @default.
- W2395605711 hasOpenAccess W2395605711 @default.
- W2395605711 hasPrimaryLocation W23956057111 @default.
- W2395605711 hasRelatedWork W1484691446 @default.
- W2395605711 hasRelatedWork W1496408413 @default.
- W2395605711 hasRelatedWork W1537328843 @default.
- W2395605711 hasRelatedWork W1936855748 @default.
- W2395605711 hasRelatedWork W2081449822 @default.
- W2395605711 hasRelatedWork W2083522899 @default.
- W2395605711 hasRelatedWork W2104835758 @default.
- W2395605711 hasRelatedWork W2107080175 @default.
- W2395605711 hasRelatedWork W2139077607 @default.
- W2395605711 hasRelatedWork W2159595426 @default.
- W2395605711 hasRelatedWork W2261198898 @default.
- W2395605711 hasRelatedWork W2270527057 @default.
- W2395605711 hasRelatedWork W2278134082 @default.
- W2395605711 hasRelatedWork W2790123248 @default.
- W2395605711 hasRelatedWork W2963161417 @default.
- W2395605711 hasRelatedWork W2963430450 @default.
- W2395605711 hasRelatedWork W2963792426 @default.
- W2395605711 hasRelatedWork W2963942199 @default.
- W2395605711 hasRelatedWork W653091471 @default.
- W2395605711 hasRelatedWork W94833765 @default.
- W2395605711 isParatext "false" @default.
- W2395605711 isRetracted "false" @default.
- W2395605711 magId "2395605711" @default.
- W2395605711 workType "article" @default.