Search Results - "Martin Koutecký"

Scheduling meets n-fold integer programming by Knop, Dušan, Koutecký, Martin

“…Scheduling problems are fundamental in combinatorial optimization. Much work has been done on approximation algorithms for NP-hard cases, but relatively little…”
Get full text

Combinatorial n-fold integer programming and applications by Knop, Dušan, Koutecký, Martin, Mnich, Matthias

“…Many fundamental NP -hard problems can be formulated as integer linear programs (ILPs). A famous algorithm by Lenstra solves ILPs in time that is exponential…”
Get full text

Uniform and monotone line sum optimization by Koutecký, Martin, Onn, Shmuel

“…The line sum optimization problem asks for a (0,1)-matrix minimizing the sum of given functions evaluated at its row and column sums. We show that the uniform…”
Get full text

Reducibility bounds of objective functions over the integers by Eisenbrand, Friedrich, Hunkenschröder, Christoph, Klein, Kim-Manuel, Koutecký, Martin, Levin, Asaf, Onn, Shmuel

“…We study the settings where we are given a separable objective function of n variables defined in a given box of integers. We show that in many cases we can…”
Get full text

Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming by Briański, Marcin, Koutecký, Martin, Král’, Daniel, Pekárková, Kristýna, Schröder, Felix

“…An intensive line of research on fixed parameter tractability of integer programming is focused on exploiting the relation between the sparsity of a constraint…”
Get full text

High-multiplicity N-fold IP via configuration LP by Knop, Dušan, Koutecký, Martin, Levin, Asaf, Mnich, Matthias, Onn, Shmuel

“…N -fold integer programs (IPs) form an important class of block-structured IPs for which increasingly fast algorithms have recently been developed and…”
Get full text

Integer programming in parameterized complexity: Five miniatures by Gavenčiak, Tomáš, Koutecký, Martin, Knop, Dušan

“…Powerful results from the theory of integer programming have recently led to substantial advances in parameterized complexity. However, our perception is that,…”
Get full text

Parameterized complexity of configuration integer programs by Knop, Dušan, Koutecký, Martin, Levin, Asaf, Mnich, Matthias, Onn, Shmuel

“…Configuration integer programs (IP) have been key in the design of algorithms for NP-hard high-multiplicity problems. First, we develop fast exact…”
Get full text

A note on the approximability of deepest-descent circuit steps by Borgwardt, Steffen, Brand, Cornelius, Feldmann, Andreas Emil, Koutecký, Martin

“…Linear programs (LPs) can be solved by polynomially many moves along the circuit direction improving the objective the most, so-called deepest-descent steps…”
Get full text

Extension Complexity, MSO Logic, and Treewidth by Kolman, Petr, Koutecký, Martin, Tiwary, Hans Raj

“…We consider the convex hull Pφ(G) of all satisfying assignments of a given MSO formula φ on a given graph G. We show that there exists an extended formulation…”
Get full text

Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth by Kolman, Petr, Koutecký, Martin

“…In this paper we provide an extended formulation for the class of constraint satisfaction problems and prove that its size is polynomial for instances whose…”
Get full text

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity by Dušan Knop, Martin Koutecký, Tomáš Masařík, Tomáš Toufar

“…This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs:…”
Get full text

Approximating max-cut under graph-MSO constraints by Koutecký, Martin, Lee, Jon, Nagarajan, Viswanath, Shen, Xiangkun

“…We consider the max-cut and max-k-cut problems under graph-based constraints. Our approach can handle any constraint specified using monadic second-order (MSO)…”
Get full text

Approximate separable multichoice optimization over monotone systems by Koutecký, Martin, Levin, Asaf, Meesum, Syed M., Onn, Shmuel

“…With each separable optimization problem over a given set of vectors is associated its multichoice counterpart which involves choosing n rather than one…”
Get full text

A Note on Coloring $$(4K_1, C_4, C_6)$$-Free Graphs with a $$C_7 by Koutecký, Martin

Get full text

A Note on Coloring (4K1,C4,C6)-Free Graphs with a C7 by Koutecký, Martin

“…Even-hole-free graphs are a graph class of much interest. Foley et al. (Graphs Comb. 36(1):125–138, 2020) have recently studied ( 4 K 1 , C 4 , C 6 ) -free…”
Get full text

Correction to: Opinion diffusion and campaigning on society graphs by Faliszewski, Piotr, Gonen, Rica, Koutecký, Martin, Talmon, Nimrod

Get full text

Opinion diffusion and campaigning on society graphs by Faliszewski, Piotr, Gonen, Rica, KoutecÝ, Martin, Talmon, Nimrod

“…Abstract We study the effects of campaigning, where the society is partitioned into voter clusters and a diffusion process propagates opinions in a network…”
Get full text

A Note on Coloring $(4K_1, C_4, C_6)$-free graphs with a $C_7 by Koutecký, Martin

“…Even-hole-free graphs are a graph class of much interest. Foley et al. [Graphs Comb. 36(1): 125-138 (2020)] have recently studied $(4K_1, C_4, C_6)$-free…”
Get full text

Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines by Koutecký, Martin, Zink, Johannes

“…The task of scheduling jobs to machines while minimizing the total makespan, the sum of weighted completion times, or a norm of the load vector, are among the…”
Get full text