scientific article; zbMATH DE number 1256763
From MaRDI portal
Publication:4228499
zbMath0924.68151MaRDI QIDQ4228499
R. Ravi, Santosh Vempala, Avrim L. Blum
Publication date: 18 May 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items (16)
Algorithms for the on-line quota traveling salesman problem ⋮ Approximation algorithms for the covering Steiner problem ⋮ Service-constrained network design problems ⋮ Solving the traveling repairman problem on a line with general processing times and deadlines ⋮ Faster geometric \(k\)-point MST approximation ⋮ Two multi-start heuristics for the \(k\)-traveling salesman problem ⋮ A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem ⋮ A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems ⋮ Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems ⋮ The online prize-collecting traveling salesman problem ⋮ Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems ⋮ An approximation algorithm for vehicle routing with compatibility constraints ⋮ Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees ⋮ Modifying edges of a network to obtain short subgraphs ⋮ An improved approximation ratio for the minimum latency problem ⋮ Prize-Collecting TSP with a Budget Constraint
This page was built for publication:
