scientific article; zbMATH DE number 2089222

MaRDI QIDQ3046491zbMATH OpenFDO

Authors Harold N. Gabow, Seth Pettie

Publication date 12 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2368/23680190.htm

Mathematics Subject Classification ID

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

Recommendations

• A faster implementation of the Goemans-Williamson clustering algorithm
• A Faster, Better Approximation Algorithm for the Minimum Latency Problem
• Publication:4886063
• Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
• An approximation algorithm for minimum-cost vertex-connectivity problems

Cited in

(2)

• A faster implementation of the Goemans-Williamson clustering algorithm
• Linear-time approximation for maximum weight matching

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 Q3046491)