Hitting sets online and vertex ranking

DOI10.1007/978-3-642-23719-5_30zbMATH Open1346.68262OpenAlexW1876682478MaRDI QIDQ3092243FDOQ3092243

Authors Guy Even, Shakhar Smorodinsky 

Publication date 16 September 2011

Published in Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-23719-5_30

zbMATH Keywords

online algorithmsset coverhitting setgeometric hypergraphs

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Graph algorithms (graph-theoretic aspects) (05C85) Hypergraphs (05C65)

Recommendations

• Hitting sets online and unique-MAX coloring
• Online hypergraph coloring
• On-line coloring of geometric intersection graphs
• On-line rankings of graphs
• A randomised approximation algorithm for the hitting set problem

Cited In (5)

• Online hitting set of \(d\)-dimensional fat objects
• On vertex rankings of graphs and its relatives
• Hitting sets when the VC-dimension is small
• Hitting sets online and unique-MAX coloring
• Hitting Set for hypergraphs of low VC-dimension

This page was built for publication: Hitting sets online and vertex ranking

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