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

From MaRDI portal
Merged Item from Q5199241
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Augmenting the connectivity of geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of geometric dispersion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energy-efficient wireless network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum-area spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connecting a set of circles with minimum sum of radii / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering to minimize the sum of cluster diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of range assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for base station coverage with minimum total radii / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-energy broadcasting in static ad hoc wireless networks / rank
 
Normal rank

Revision as of 03:59, 15 July 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

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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
19 February 2018
0 references
12 August 2011
0 references
intersection graphs
0 references
connectivity problems
0 references
NP-hardness
0 references
approximation
0 references
upper and lower bounds
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references