A data structure for bicategories, with application to speeding up an approximation algorithm

DOI10.1016/0020-0190(94)00156-1zbMath0938.68587OpenAlexW2068799282MaRDI QIDQ1342258

Philip N. Klein

Publication date: 21 June 2000

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00156-1

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Data structures (68P05) Approximation algorithms (68W25)

Related Items (3)

Primal-dual approximation algorithms for the prize-collecting Steiner tree problem ⋮ An efficient approximation algorithm for the survivable network design problem ⋮ Unnamed Item

Cites Work

• A fast algorithm for Steiner trees
• Finding Minimum Spanning Trees
• A faster approximation algorithm for the Steiner problem in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A data structure for bicategories, with application to speeding up an approximation algorithm