An efficient algorithm for judicious partition of hypergraphs

DOI10.1007/978-3-319-71147-8_33MaRDI QIDQ1708643zbMATHOpenAlexFDO

Authors Tunzi Tan, Jihong Gui, Sainan Wang, Wenguo Yang, Suixiang Gao

Publication date 26 March 2018

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

zbMATH Keywords

approximation algorithmhypergraphjudicious partitionminimum set cover

Mathematics Subject Classification ID

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

Recommendations

• Solution of one problem of optimal partition of the vertex set of a hypergraph
• Problems and results on judicious partitions
• Judicious \(k\)-partitions of graphs
• Judicious partitioning of hypergraphs with edges of size at most 2
• On several partitioning problems of Bollobás and Scott

Cited in

(6)

• Clustering in hypergraphs to minimize average edge service time
• A hybrid exact algorithm for complete set partitioning
• An exact algorithm for min-max hyperstructure equipartition with a connected constraint
• A note on hypergraph decomposition based on extended minimal sets
• scientific article; zbMATH DE number 2079358 (Why is no real title available?)
• Solution of one problem of optimal partition of the vertex set of a hypergraph

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

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