scientific article; zbMATH DE number 1775395
From MaRDI portal
Publication:4542528
zbMath1028.68223MaRDI QIDQ4542528
Sudipto Guha, Chandra Chekuri, Ashish Goel, Moses Charikar
Publication date: 27 January 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (22)
$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm ⋮ Multifacility ordered median problems on networks: A further analysis ⋮ Approximation algorithms for the covering Steiner problem ⋮ Budget constrained minimum cost connected medians ⋮ Stochastic approximation of lamplighter metrics ⋮ Minimum restricted diameter spanning trees. ⋮ Using Petal-Decompositions to Build a Low Stretch Spanning Tree ⋮ Approximating \(k\)-generalized connectivity via collapsing HSTs ⋮ Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems ⋮ Ant colony optimization for finding medians of weighted graphs ⋮ On the \(p\)-median polytope of \(Y\)-free graphs ⋮ Multi-way spectral partitioning and higher-order cheeger inequalities ⋮ The \(k\)-centrum multi-facility location problem ⋮ Unnamed Item ⋮ A tight bound on approximating arbitrary metrics by tree metrics ⋮ New approximation algorithms for the heterogeneous weighted delivery problem ⋮ New approximation algorithms for the heterogeneous weighted delivery problem ⋮ Constant-Factor FPT Approximation for Capacitated k-Median ⋮ A greedy approximation algorithm for the group Steiner problem ⋮ Low complexity variants of the arrow distributed directory ⋮ A constant-factor approximation algorithm for the \(k\)-median problem ⋮ To close is easier than to open: dual parameterization to \(k\)-median
This page was built for publication:
