scientific article; zbMATH DE number 7378609

DOI10.4230/LIPIcs.IPEC.2018.23MaRDI QIDQ5009486

Katrin Casel

Publication date: 4 August 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

clusteringtriangle inequalityparameterised approximation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx)

Related Items (4)

13th International Symposium on Parameterized and Exact Computation (IPEC 2018) ⋮ On the Complexity of Broadcast Domination and Multipacking in Digraphs ⋮ Two generalizations of proper coloring: hardness and approximability ⋮ On the complexity of broadcast domination and multipacking In digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast branching algorithm for cluster vertex deletion
• Fundamentals of parameterized complexity
• Parameterized complexity of coloring problems: treewidth versus vertex cover
• On the complexity of some colorful problems parameterized by treewidth
• Improved upper bounds for vertex cover
• Clustering with lower-bounded sizes. A general graph-theoretic framework
• Strong computational lower bounds via parameterized complexity
• On the parameterized complexity of multiple-interval graph problems
• A 1.488 approximation algorithm for the uncapacitated facility location problem
• Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
• Heuristics for the fixed cost median problem
• Parameterized Inapproximability of Target Set Selection and Generalizations
• Analytical approach to parallel repetition
• Parameterized and Exact Computation
• Slightly Superexponential Parameterized Problems
• On the complexity of \(k\)-SAT

This page was built for publication: