An efficient algorithm for judicious partition of hypergraphs

DOI10.1007/978-3-319-71147-8_33zbMath1474.05374OpenAlexW2769933795MaRDI QIDQ1708643

Sainan Wang, Jihong Gui, Tunzi Tan, Wenguo Yang, Sui-Xiang Gao

Publication date: 26 March 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-71147-8_33

zbMATH Keywords

hypergraphapproximation algorithmjudicious partitionminimum set cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: An efficient algorithm for judicious partition of hypergraphs