Polynomial time approximation schemes for clustering in low highway dimension graphs (Q2229951): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3185122763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5874516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Strikes Back: Improved Facility Location Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new greedy approach for facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5368726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bypassing the embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 1.488 approximation algorithm for the uncapacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Approximation for <i>k</i>-median, and Positive Correlation in Budgeted Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search Yields a PTAS for $k$-Means in Doubling Metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Travelling on graphs with small highway dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchy of Transportation Network Parameters and Hardness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Linear-Time Approximation Scheme for the Euclidean <i>k</i>-Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highway Dimension and Provably Efficient Shortest Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: VC-Dimension and Shortest Path Algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:01, 26 July 2024

scientific article
Language Label Description Also known as
English
Polynomial time approximation schemes for clustering in low highway dimension graphs
scientific article

    Statements

    Polynomial time approximation schemes for clustering in low highway dimension graphs (English)
    0 references
    0 references
    0 references
    17 September 2021
    0 references
    approximation algorithm
    0 references
    highway dimension
    0 references
    clustering
    0 references

    Identifiers