scientific article; zbMATH DE number 1445374
From MaRDI portal
Publication:4952696
Recommendations
- A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem
- Saving an epsilon: a 2-approximation for the k-MST problem in graphs
- A 2.5-factor approximation algorithm for the k-MST problem
- scientific article; zbMATH DE number 1256763
- A constant-factor approximation algorithm for the \(k\)-MST problem
Cited in
(25)- Computing small partial coverings
- The bottleneck \(k\)-MST
- A constant-factor approximation algorithm for the \(k\)-MST problem
- Faster geometric \(k\)-point MST approximation
- A note on the $k$-minimum spanning tree problem on circles
- Subexponential algorithms for partial cover problems
- A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem
- A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem
- Honey-pot constrained searching with local sensory information
- Two multi-start heuristics for the \(k\)-traveling salesman problem
- An O( k) approximation algorithm for the k minimum spanning tree problem in the plane
- md-MST is NP-hard for \(d\geq 3\)
- A 2.5-factor approximation algorithm for the k-MST problem
- Algorithms for the maximum weight connected k-induced subgraph problem
- Saving an epsilon: a 2-approximation for the k-MST problem in graphs
- On the approximability of dense Steiner problems
- scientific article; zbMATH DE number 1256763 (Why is no real title available?)
- scientific article; zbMATH DE number 1263203 (Why is no real title available?)
- Approximation algorithms for the covering Steiner problem
- Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
- Simple heuristics for the rooted max tree coverage problem
- A better approximation algorithm for the budget prize collecting tree problem.
- Budget constrained minimum cost connected medians
- Approximation algorithm for minimizing total latency in machine scheduling with deliveries
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 Q4952696)
