scientific article; zbMATH DE number 1445374
From MaRDI portal
Publication:4952696
zbMath0961.68104MaRDI QIDQ4952696
Publication date: 10 May 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
Approximation algorithms for the covering Steiner problem ⋮ Two multi-start heuristics for the \(k\)-traveling salesman problem ⋮ Budget constrained minimum cost connected medians ⋮ Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem ⋮ On the approximability of dense Steiner problems ⋮ A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem ⋮ Subexponential algorithms for partial cover problems ⋮ Approximation algorithm for minimizing total latency in machine scheduling with deliveries ⋮ A better approximation algorithm for the budget prize collecting tree problem. ⋮ Honey-pot constrained searching with local sensory information ⋮ Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems ⋮ Computing small partial coverings ⋮ Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
This page was built for publication:
