Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions,arXiv - CS - Discrete Mathematics

当前位置： X-MOL 学术 › arXiv.cs.DM › 论文详情

Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)

Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions
arXiv - CS - Discrete Mathematics Pub Date : 2019-10-01 , DOI: arxiv-1910.00277
Matthias Bentert and Ren\'e van Bevern and Till Fluschnik and Andr\'e Nichterlein and Rolf Niedermeier

Kernelization is the fundamental notion for polynomial-time data reduction with performance guarantees. Kernelization for weighted problems particularly requires to also shrink weights. Marx and V\'egh [ACM Trans. Algorithms 2015] and Etscheid et al. [J. Comput. Syst. Sci. 2017] used a technique of Frank and Tardos [Combinatorica 1987] to obtain polynomial-size kernels for weighted problems, mostly with additive goal functions. We lift the technique to linearizable functions, a function type that we introduce and that also contains non-additive functions. Using the lifted technique, we obtain kernelization results for natural problems in graph partitioning, network design, facility location, scheduling, vehicle routing, and computational social choice, thereby improving and generalizing results from the literature.

更新日期：2020-02-19

点击分享查看原文

点击收藏

阅读更多本刊最新论文

全部期刊列表>>