scientific article; zbMATH DE number 1757947

zbMath0987.68102MaRDI QIDQ4537735

Tim Roughgarden, David P. Williamson, Fabián A. Chudak

Publication date: 20 June 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2081/20810060

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation algorithms (68W25)

Related Items (6)

Clustering to minimize the sum of cluster diameters ⋮ An approximation algorithm for \(P\)-prize-collecting set cover problem ⋮ Euclidean prize-collecting Steiner forest ⋮ An approximation algorithm for the \(k\)-prize-collecting multicut on a tree problem ⋮ Approximating \(k\)-forest with resource augmentation: a primal-dual approach ⋮ Approximating fault-tolerant group-Steiner problems

This page was built for publication: