The \(p\)-neighbor \(k\)-center problem (Q293209): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Shiva P. Chaudhuri / rank
Normal rank
 
Property / author
 
Property / author: Shiva P. Chaudhuri / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Q3316922 / 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: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault tolerant \(K\)-center problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the p-center problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037432 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023936492 / rank
 
Normal rank

Latest revision as of 10:32, 30 July 2024

scientific article
Language Label Description Also known as
English
The \(p\)-neighbor \(k\)-center problem
scientific article

    Statements

    The \(p\)-neighbor \(k\)-center problem (English)
    0 references
    0 references
    0 references
    0 references
    9 June 2016
    0 references
    design of algorithms
    0 references
    facility location
    0 references
    centers
    0 references
    approximation algorithms
    0 references

    Identifiers