A Stab at Approximating Minimum Subadditive Join

DOI10.1007/978-3-540-73951-7_19zbMATH Open1209.68654OpenAlexW2102922581MaRDI QIDQ3603528FDOQ3603528

Authors 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

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

Recommendations

• A mathematical study on statistical database designs
• Automata, Languages and Programming
• Tight results on minimum entropy set cover
• Tight Results on Minimum Entropy Set Cover
• The minimum entropy submodular set cover problem

Cited In (5)

• The hospitals/residents problem with lower quotas
• Submodular functions: learnability, structure, and optimization
• Approximating max-min weighted \(T\)-joins
• On the complexity of fair house allocation
• On the inapproximability of minimizing cascading failures under the deterministic threshold model

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603528)