On Kernelization and Approximation for the Vector Connectivity Problem

DOI10.4230/LIPIcs.IPEC.2015.377zbMath1372.68137OpenAlexW2595985379MaRDI QIDQ5363790

Manuel Sorge, Stefan Kratsch

Publication date: 29 September 2017

Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.IPEC.2015.377

zbMATH Keywords

approximationparameterized complexitykernelization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)

Related Items (2)

Designing FPT Algorithms for Cut Problems Using Randomized Contractions ⋮ On kernelization and approximation for the vector connectivity problem

This page was built for publication: On Kernelization and Approximation for the Vector Connectivity Problem