scientific article; zbMATH DE number 1163714
From MaRDI portal
Publication:4395327
Recommendations
Cited in
(24)- Improved approximation bounds for edge dominating set in dense graphs
- Fast stabbing of boxes in high dimensions
- A taxonomy for emergency service station location problem
- Approximating the dense set-cover problem
- An approximation of the minimum vertex cover in a graph
- Density, forcing, and the covering problem
- Tight approximation bounds for combinatorial frugal coverage algorithms
- The connected vertex cover problem in \(k\)-regular graphs
- On the average-case complexity of pattern matching with wildcards
- scientific article; zbMATH DE number 1594511 (Why is no real title available?)
- Approximating subdense instances of covering problems
- On approximation complexity of metric dimension problem
- Approximating edge dominating set in dense graphs
- Parallel approximation to high multiplicity scheduling problemsVIAsmooth multi-valued quadratic programming
- Connected Vertex Covers in Dense Graphs
- On the approximability of dense Steiner problems
- Approximating vertex cover in dense hypergraphs
- Approximation complexity of metric dimension problem
- Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs
- On point covers of c-oriented polygons
- Improved non-approximability results for vertex cover with density constraints
- Exact and heuristic approaches for the set cover with pairs problem
- Approximating edge dominating set in dense graphs
- Connected vertex covers in dense graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4395327)
