Connecting a set of circles with minimum sum of radii (Q1699280): Difference between revisions

Latest revision as of 05:51, 28 December 2024

scientific article; zbMATH DE number 5938272

Connecting a Set of Circles with Minimum Sum of Radii

Language	Label	Description	Also known as
English	Connecting a set of circles with minimum sum of radii	scientific article; zbMATH DE number 5938272	Connecting a Set of Circles with Minimum Sum of Radii

Statements

instance of

scholarly article

0 references

title

Connecting a set of circles with minimum sum of radii (English)

0 references

Connecting a Set of Circles with Minimum Sum of Radii (English)

0 references

author

Sándor P. Fekete

0 references

Hella-Franziska Hoffmann

0 references

Dimitri Marinakis

0 references

Joseph S. B. Mitchell

0 references

0 references

0 references

0 references

0 references

Computational Geometry

0 references

Lecture Notes in Computer Science

0 references

publication date

19 February 2018

0 references

12 August 2011

0 references

full work available at URL

https://arxiv.org/abs/1105.0791

0 references

zbMATH Keywords

intersection graphs

0 references

connectivity problems

0 references

NP-hardness

0 references

approximation

0 references

upper and lower bounds

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Augmenting the connectivity of geometric graphs

0 references

Q3601572

0 references

Reverse search for enumeration

0 references

Approximation of geometric dispersion problems

0 references

Algorithms – ESA 2005

0 references

Energy-efficient wireless network design

0 references

Algorithm Theory - SWAT 2004

0 references

The minimum-area spanning tree problem

0 references

Connecting a set of circles with minimum sum of radii

0 references

Clustering to minimize the sum of cluster diameters

0 references

Q2708233

0 references

On the hardness of range assignment problems

0 references

Q3579384

0 references

Polynomial time approximation schemes for base station coverage with minimum total radii

0 references

Planar Formulae and Their Uses

0 references

Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems

0 references

Minimum-energy broadcasting in static ad hoc wireless networks

0 references

Identifiers

zbMATH Open document ID

1380.05113

0 references

1342.68355

0 references

DOI

10.1007/978-3-642-22300-6_16

0 references

10.1016/J.COMGEO.2017.06.002

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1699280

@@ Property / DOI @@
-.1016/j.comgeo.2017.06.002
@@ Property / DOI: 10.1016/j.comgeo.2017.06.002 / rank @@
-Normal rank
@@ Property / DOI @@
+.1016/J.COMGEO.2017.06.002
@@ Property / DOI: 10.1016/J.COMGEO.2017.06.002 / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting the connectivity of geometric graphs
@@ Property / cites work: Augmenting the connectivity of geometric graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3601572
@@ Property / cites work: Q3601572 / rank @@
+Normal rank
@@ Property / cites work @@
+Reverse search for enumeration
@@ Property / cites work: Reverse search for enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation of geometric dispersion problems
@@ Property / cites work: Approximation of geometric dispersion problems / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Energy-efficient wireless network design
@@ Property / cites work: Energy-efficient wireless network design / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum-area spanning tree problem
@@ Property / cites work: The minimum-area spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Connecting a set of circles with minimum sum of radii
+Normal rank
@@ Property / cites work @@
+Clustering to minimize the sum of cluster diameters
+Normal rank
@@ Property / cites work @@
+Q2708233
@@ Property / cites work: Q2708233 / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of range assignment problems
@@ Property / cites work: On the hardness of range assignment problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579384
@@ Property / cites work: Q3579384 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for base station coverage with minimum total radii
+Normal rank
@@ Property / cites work @@
+Planar Formulae and Their Uses
@@ Property / cites work: Planar Formulae and Their Uses / rank @@
+Normal rank
@@ Property / cites work @@
+Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems
+Normal rank
@@ Property / cites work @@
+Minimum-energy broadcasting in static ad hoc wireless networks
+Normal rank