scientific article; zbMATH DE number 1263203
From MaRDI portal
Publication:4234074
zbMath0920.90136MaRDI QIDQ4234074
Baruch Awerbuch, Yossi Azar, Santosh Vempala, Avrim L. Blum
Publication date: 15 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
traveling salesmanapproximation algorithmsorienteering problembank-robber problempoly-logarithmic performanceprize-collecting salesmen
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (15)
Algorithms for the on-line quota traveling salesman problem ⋮ Robust optimization for routing problems on trees ⋮ \(k\)-edge subgraph problems ⋮ Faster geometric \(k\)-point MST approximation ⋮ Compact location problems ⋮ Complexity and approximability of certain bicriteria location problems ⋮ Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem ⋮ An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems ⋮ The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices ⋮ Local search algorithms for the \(k\)-cardinality tree problem. ⋮ An improved approximation ratio for the minimum latency problem ⋮ A constant-factor approximation algorithm for the \(k\)-MST problem ⋮ Approximation algorithms for time-dependent orienteering.
This page was built for publication:
