The following pages link to (Q4542528):
Displaying 23 items.
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- Budget constrained minimum cost connected medians (Q876728) (← links)
- On the \(p\)-median polytope of \(Y\)-free graphs (Q951093) (← links)
- Minimum restricted diameter spanning trees. (Q1427810) (← links)
- Low complexity variants of the arrow distributed directory (Q1604202) (← links)
- A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
- To close is easier than to open: dual parameterization to \(k\)-median (Q2117693) (← links)
- A greedy approximation algorithm for the group Steiner problem (Q2581556) (← links)
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
- Approximation algorithms for the covering Steiner problem (Q4537631) (← links)
- Using Petal-Decompositions to Build a Low Stretch Spanning Tree (Q4629391) (← links)
- Multifacility ordered median problems on networks: A further analysis (Q4797942) (← links)
- Ant colony optimization for finding medians of weighted graphs (Q4908024) (← links)
- Constant-Factor FPT Approximation for Capacitated k-Median (Q5075732) (← links)
- (Q5091191) (← links)
- Multi-way spectral partitioning and higher-order cheeger inequalities (Q5415539) (← links)
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm (Q5890148) (← links)
- A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)
- New approximation algorithms for the heterogeneous weighted delivery problem (Q5918637) (← links)
- New approximation algorithms for the heterogeneous weighted delivery problem (Q5918793) (← links)
- The \(k\)-centrum multi-facility location problem (Q5931794) (← links)
- Stochastic approximation of lamplighter metrics (Q6048880) (← links)
- Multi-candidate carpooling routing problem and its approximation algorithms (Q6606200) (← links)
