Pages that link to "Item:Q5901856"
From MaRDI portal
The following pages link to Foundations of Information and Knowledge Systems (Q5901856):
Displaying 7 items.
- An approximation algorithm for submodular hitting set problem with linear penalties (Q830939) (← links)
- Semi-hyper-connected vertex transitive graphs (Q1011726) (← links)
- Counting minimal transversals of \(\beta\)-acyclic hypergraphs (Q1713476) (← links)
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
- Hypergraphs with large transversal number (Q1946666) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
- Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)