Generalized \(p\)-center problems: Complexity results and approximation algorithms (Q1278142): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: The slab dividing approach to solve the Euclidean \(P\)-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On alternativep-center problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / 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: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank

Latest revision as of 17:29, 28 May 2024

scientific article
Language Label Description Also known as
English
Generalized \(p\)-center problems: Complexity results and approximation algorithms
scientific article

    Statements

    Generalized \(p\)-center problems: Complexity results and approximation algorithms (English)
    0 references
    0 references
    0 references
    24 August 1999
    0 references
    \(p\)-Center problems
    0 references
    NP-complete
    0 references
    polynomial time approximation
    0 references

    Identifiers