scientific article; zbMATH DE number 1163714
From MaRDI portal
Publication:4395327
zbMath0896.68078MaRDI QIDQ4395327
Alexander Z. Zelikovsky, Marek Karpinski
Publication date: 1 October 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (20)
On the average-case complexity of pattern matching with wildcards ⋮ On the approximability of dense Steiner problems ⋮ The connected vertex cover problem in \(k\)-regular graphs ⋮ Parallel approximation to high multiplicity scheduling problemsVIAsmooth multi-valued quadratic programming ⋮ Approximating vertex cover in dense hypergraphs ⋮ Approximation complexity of metric dimension problem ⋮ Connected Vertex Covers in Dense Graphs ⋮ On Approximation Complexity of Metric Dimension Problem ⋮ Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs ⋮ Approximating Edge Dominating Set in Dense Graphs ⋮ Exact and heuristic approaches for the set cover with pairs problem ⋮ A taxonomy for emergency service station location problem ⋮ An approximation of the minimum vertex cover in a graph ⋮ Approximating the dense set-cover problem ⋮ Connected vertex covers in dense graphs ⋮ On point covers of \(c-\)oriented polygons ⋮ Improved approximation bounds for edge dominating set in dense graphs ⋮ Approximating edge dominating set in dense graphs ⋮ Approximating Subdense Instances of Covering Problems ⋮ Fast stabbing of boxes in high dimensions
This page was built for publication:
