Fault tolerant \(K\)-center problems (Q1575549): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: How to Allocate Network Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(p\)-neighbor \(k\)-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple heuristic for the p-centre problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck extrema / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / 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: Easy and hard bottleneck location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault tolerant \(K\)-center problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated K-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the p-center problem in graphs / rank
 
Normal rank

Latest revision as of 13:12, 30 May 2024

scientific article
Language Label Description Also known as
English
Fault tolerant \(K\)-center problems
scientific article

    Statements

    Fault tolerant \(K\)-center problems (English)
    0 references
    0 references
    0 references
    0 references
    21 August 2000
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    facility location
    0 references
    \(K\)-center
    0 references
    fault-tolerance
    0 references