scientific article; zbMATH DE number 1263203
From MaRDI portal
Publication:4234074
Recommendations
Cited in
(17)- An improved approximation ratio for the minimum latency problem
- A constant-factor approximation algorithm for the \(k\)-MST problem
- \(k\)-edge subgraph problems
- Faster geometric \(k\)-point MST approximation
- Compact location problems
- The computational complexity of the k-minimum spanning tree problem in graded matrices
- Local search algorithms for the \(k\)-cardinality tree problem.
- Approximation algorithms for time-dependent orienteering.
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Robust optimization for routing problems on trees
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
- Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
- Complexity and approximability of certain bicriteria location problems
- An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane
- Faster approximation scheme for Euclidean k-TSP
- Algorithms for the on-line quota 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 Q4234074)
