scientific article; zbMATH DE number 1775395
From MaRDI portal
Publication:4542528
zbMATH Open1028.68223MaRDI QIDQ4542528FDOQ4542528
Authors: Chandra Chekuri, Ashish Goel, Sudipto Guha, Moses Charikar 
Publication date: 27 January 2004
Title of this publication is not available (Why is that?)
Recommendations
Cited In (21)
- On the fixed-parameter tractability of capacitated clustering
- To close is easier than to open: dual parameterization to \(k\)-median
- A tight bound on approximating arbitrary metrics by tree metrics
- A constant-factor approximation algorithm for the \(k\)-median problem
- Minimum restricted diameter spanning trees.
- Stochastic approximation of lamplighter metrics
- Using petal-decompositions to build a low stretch spanning tree
- On the \(p\)-median polytope of \(Y\)-free graphs
- Multi-candidate carpooling routing problem and its approximation algorithms
- Multifacility ordered median problems on networks: A further analysis
- Low complexity variants of the arrow distributed directory
- Budget constrained minimum cost connected medians
- The \(k\)-centrum multi-facility location problem
- A greedy approximation algorithm for the group Steiner problem
- New approximation algorithms for the heterogeneous weighted delivery problem
- New approximation algorithms for the heterogeneous weighted delivery problem
- Ant colony optimization for finding medians of weighted graphs
- Constant-Factor FPT Approximation for Capacitated k-Median
- Approximating \(k\)-generalized connectivity via collapsing HSTs
- Approximation algorithms for the covering Steiner problem
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542528)
