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

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q5199241
aliases / en / 0aliases / en / 0
 
Connecting a Set of Circles with Minimum Sum of Radii
description / endescription / en
 
scientific article; zbMATH DE number 5938272
Property / title
 
Connecting a Set of Circles with Minimum Sum of Radii (English)
Property / title: Connecting a Set of Circles with Minimum Sum of Radii (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1342.68355 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-22300-6_16 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
12 August 2011
Timestamp+2011-08-12T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 12 August 2011 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5938272 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1884830105 / rank
 
Normal rank

Revision as of 08:18, 6 May 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