The Coverage Problem by Aligned Disks (Q6173214): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3601572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4377122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE ALIGNED K-CENTER PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the one-dimensional \(k\)-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for facility location problems on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved complexity bounds for location problems on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some variations on constrained minimum enclosing circle problem / 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: On the Complexity of Some Common Geometric Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on the Complexity of <i>p</i>-Centre Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on minimum-sum coverage by aligned disks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane / rank
 
Normal rank

Latest revision as of 19:57, 1 August 2024

scientific article; zbMATH DE number 7715068
Language Label Description Also known as
English
The Coverage Problem by Aligned Disks
scientific article; zbMATH DE number 7715068

    Statements

    Identifiers