scientific article; zbMATH DE number 1256763
From MaRDI portal
Publication:4228499
Recommendations
- A constant-factor approximation algorithm for the \(k\)-MST problem
- scientific article; zbMATH DE number 1263205
- A 2.5-factor approximation algorithm for the k-MST problem
- A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem
- scientific article; zbMATH DE number 1445374
- A Constant-Factor Approximation Algorithm for the Geometrick-MST Problem in the Plane
- A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)
- A constant-factor approximation algorithm for the k-median problem
- A deterministic algorithm for the MST problem in constant rounds of congested clique
- scientific article; zbMATH DE number 2086229
Cited in
(27)- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees
- The bottleneck \(k\)-MST
- Modifying edges of a network to obtain short subgraphs
- An improved approximation ratio for the minimum latency problem
- A constant-factor approximation algorithm for the \(k\)-MST problem
- Faster geometric \(k\)-point MST approximation
- An approximation algorithm for vehicle routing with compatibility constraints
- A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem
- A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem
- Two multi-start heuristics for the \(k\)-traveling salesman problem
- A 2.5-factor approximation algorithm for the k-MST problem
- scientific article; zbMATH DE number 1003287 (Why is no real title available?)
- Solving the traveling repairman problem on a line with general processing times and deadlines
- Saving an epsilon: a 2-approximation for the k-MST problem in graphs
- scientific article; zbMATH DE number 1263205 (Why is no real title available?)
- Approximation algorithms for the covering Steiner problem
- scientific article; zbMATH DE number 1757947 (Why is no real title available?)
- scientific article; zbMATH DE number 1445374 (Why is no real title available?)
- Service-constrained network design problems
- Prize-collecting TSP with a budget constraint
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
- Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
- A deterministic algorithm for the MST problem in constant rounds of congested clique
- A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems
- Simple heuristics for the rooted max tree coverage problem
- Algorithms for the on-line quota traveling salesman problem
- The online prize-collecting traveling salesman problem
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 Q4228499)
