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

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Connecting a Set of Circles with Minimum Sum of Radii
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 5938272
@@ Property / DOI @@
-.1016/j.comgeo.2017.06.002
@@ Property / DOI: 10.1016/j.comgeo.2017.06.002 / rank @@
-Normal rank
@@ Property / author @@
-Erin Wolf Chambers
@@ Property / author: Erin Wolf Chambers / rank @@
-Normal rank
@@ Property / author @@
-S. H. Whitesides
@@ Property / author: S. H. Whitesides / rank @@
-Normal rank
@@ Property / title @@
+Connecting a Set of Circles with Minimum Sum of Radii (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68355
@@ Property / zbMATH Open document ID: 1342.68355 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-642-22300-6_16
@@ Property / DOI: 10.1007/978-3-642-22300-6_16 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.COMGEO.2017.06.002
@@ Property / DOI: 10.1016/J.COMGEO.2017.06.002 / rank @@
+Normal rank
@@ Property / author @@
+Erin Wolf Chambers
@@ Property / author: Erin Wolf Chambers / rank @@
+Normal rank
@@ Property / author @@
+S. H. Whitesides
@@ Property / author: S. H. Whitesides / rank @@
+Normal rank
@@ Property / published in @@
+Lecture Notes in Computer Science
@@ Property / published in: Lecture Notes in Computer Science / rank @@
+Normal rank
@@ Property / publication date @@
+August 2011Timestamp +2011-08-12T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2011-08-12T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 12 August 2011 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+5938272
@@ Property / zbMATH DE Number: 5938272 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2623275761
@@ Property / OpenAlex ID: W2623275761 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1884830105
@@ Property / OpenAlex ID: W1884830105 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0791
@@ Property / arXiv ID: 1105.0791 / 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

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