Pairs Covered by a Sequence of Sets

DOI10.1007/978-3-319-22177-9_17zbMath1434.68124OpenAlexW1153009270MaRDI QIDQ2947882

Peter Damaschke

Publication date: 29 September 2015

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-22177-9_17

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Data structures (68P05)

Related Items (1)

Calculating approximation guarantees for partial set cover of pairs

Cites Work

• Unnamed Item
• On maximal frequent and minimal infrequent sets in binary matrices
• Clique Cover and Graph Separation
• Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
• Covering Analysis of the Greedy Algorithm for Partial Cover
• Data Reduction, Exact, and Heuristic Algorithms for Clique Cover

This page was built for publication: Pairs Covered by a Sequence of Sets