IIS-Hypergraphs

From MaRDI portal

Publication:4717573

Jump to:navigation, search

DOI10.1137/S0895480194270469zbMath0861.05047OpenAlexW2911564537MaRDI QIDQ4717573

Jennifer K. Ryan

Publication date: 14 January 1997

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480194270469

zbMATH Keywords

linear programming hypergraph greedy algorithm transversal number inconsistent subsystem

Mathematics Subject Classification ID

Linear programming (90C05) Hypergraphs (05C65) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Generating all vertices of a polyhedron is hard

This page was built for publication: IIS-Hypergraphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4717573&oldid=18959368"