A Stab at Approximating Minimum Subadditive Join

DOI10.1007/978-3-540-73951-7_19zbMath1209.68654OpenAlexW2102922581MaRDI QIDQ3603528

Staal Vinterbo

Publication date: 17 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_19

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25) Semilattices (06A12)

Related Items (4)

Submodular Functions: Learnability, Structure, and Optimization ⋮ On the complexity of fair house allocation ⋮ On the inapproximability of minimizing cascading failures under the deterministic threshold model ⋮ The hospitals/residents problem with lower quotas

This page was built for publication: A Stab at Approximating Minimum Subadditive Join