Approximability of open k-monopoly problems
From MaRDI portal
Publication:2048211
Recommendations
Cites work
- scientific article; zbMATH DE number 1954391 (Why is no real title available?)
- scientific article; zbMATH DE number 2104820 (Why is no real title available?)
- scientific article; zbMATH DE number 5056647 (Why is no real title available?)
- A threshold of ln n for approximating set cover
- Complexity of majority monopoly and signed domination problems
- Efficient bounds for the stable set, vertex cover and set packing problems
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs
- Optimization, approximation, and complexity classes
- Rounding algorithms for covering problems
- Some APX-completeness results for cubic graphs
- The node-deletion problem for hereditary properties is NP-complete
- The power of small coalitions in graphs
Cited in
(4)
This page was built for publication: Approximability of open \(k\)-monopoly problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2048211)