Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs (Q1799228): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4720067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location on Tree Networks: <i>P</i>-Centre and <i>n</i>-Dispersion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and Covering δ-Hyperbolic Spaces by Balls / 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: The discrete p-dispersion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison Of Four Models For dispersing Facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of \(p\)-dispersion heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772406 / 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: Efficient Algorithms for Shortest Paths in Sparse Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037432 / rank
 
Normal rank

Latest revision as of 23:08, 16 July 2024

scientific article
Language Label Description Also known as
English
Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references