Parameterized shifted combinatorial optimization

DOI10.1016/j.jcss.2018.06.002zbMath1408.68075arXiv1702.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)

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)

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.

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

This page was built for publication: Parameterized shifted combinatorial optimization