The connected disk covering problem (Q1702836): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-017-0195-0 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-017-0195-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2766322406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The slab dividing approach to solve the Euclidean \(P\)-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithm for placing a given number of base stations to cover a convex region / rank
 
Normal rank
Property / cites work
 
Property / cites work: VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION / rank
 
Normal rank
Property / cites work
 
Property / cites work: The p-Centre Problem-Heuristic and Optimal Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for \(k\)-center problem on a convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering to minimize the maximum intercluster distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Best Possible Heuristic for the <i>k</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Line-Constrained k-center in the Plane for Small k / 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: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / 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: Minimum connected dominating sets and maximal independent sets in unit disk graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-017-0195-0 / rank
 
Normal rank

Latest revision as of 04:55, 11 December 2024

scientific article
Language Label Description Also known as
English
The connected disk covering problem
scientific article

    Statements

    The connected disk covering problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 March 2018
    0 references
    \(K\)-center problem
    0 references
    computational geometry
    0 references
    facility location problem
    0 references
    unit disk graphs
    0 references

    Identifiers