Publication:5915595

DOI10.1007/978-3-319-62389-4_19zbMath1408.68075DBLPjournals/jcss/GajarskyHKO19arXiv1702.06844OpenAlexW2594848484WikidataQ62044459 ScholiaQ62044459MaRDI QIDQ5915595

Jakub Gajarský, Shmuel Onn, Petr Hliněný, Martin Koutecký

Publication date: 10 December 2018

Published in: Journal of Computer and System Sciences, Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: Shifted combinatorial optimization is a new nonlinear optimization framework which is a broad extension of standard combinatorial optimization, involving the choice of several feasible solutions at a time. This framework captures well studied and diverse problems ranging from so-called vulnerability problems to sharing and partitioning problems. In particular, every standard combinatorial optimization problem has its shifted counterpart, which is typically much harder. Already with explicitly given input set the shifted problem may be NP-hard. In this article we initiate a study of the parameterized complexity of this framework. First we show that shifting over an explicitly given set with its cardinality as the parameter may be in XP, FPT or P, depending on the objective function. Second, we study the shifted problem over sets definable in MSO logic (which includes, e.g., the well known MSO partitioning problems). Our main results here are that shifted combinatorial optimization over MSO definable sets is in XP with respect to the MSO formula and the treewidth (or more generally clique-width) of the input graph, and is W[1]-hard even under further severe restrictions.

Full work available at URL: https://arxiv.org/abs/1702.06844

zbMATH Keywords

combinatorial optimizationtreewidthMSO logicMSO partitioningshifted problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Logic in computer science (03B70) Descriptive complexity and finite models (68Q19)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding a collective set of items: from proportional multirepresentation to group recommendation
• Fundamentals of parameterized complexity
• Finding paths with minimum shared edges
• The minimum vulnerability problem
• Strong computational lower bounds via parameterized complexity
• MSOL partitioning problems on graphs of bounded treewidth and clique-width
• Nonlinear discrete optimization. An algorithmic theory
• Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
• Shifted matroid optimization
• Integer convex minimization by mixed integer linear optimization
• The unimodular intersection problem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Colorings of \(k\)-balanced matrices and integer decomposition property of related polyhedra
• A class of games possessing pure-strategy Nash equilibria
• Parameterized Algorithms for Modular-Width
• When Trees Grow Low: Shrubs and Fast MSO1
• Elections with Few Candidates: Prices, Weights, and Covering Problems
• Algorithmic Meta-theorems
• Nonlinear Integer Programming
• Lectures on Polytopes
• The Matching Polytope has Exponential Extension Complexity
• A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
• Evaluation of an MSO-Solver
• The Parameterized Complexity of the Minimum Shared Edges Problem
• Paths, Trees, and Flowers
• Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
• Convex separable optimization is not much harder than linear optimization
• Extended formulations in combinatorial optimization
• Finding Branch-Decompositions and Rank-Decompositions

Related Items (4)

Optimization over Degree Sequences ⋮ Integer programming in parameterized complexity: five miniatures ⋮ Approximate separable multichoice optimization over monotone systems ⋮ Integer Programming in Parameterized Complexity: Three Miniatures.

This page was built for publication: Parameterized shifted combinatorial optimization