271 research outputs found
Combinatorial Optimization
Combinatorial Optimization is a very active field that benefits from bringing together ideas from different areas, e.g., graph theory and combinatorics, matroids and submodularity, connectivity and network flows, approximation algorithms and mathematical programming, discrete and computational geometry, discrete and continuous problems, algebraic and geometric methods, and applications. We continued the long tradition of triannual Oberwolfach workshops, bringing together the best researchers from the above areas, discovering new connections, and establishing new and deepening existing international collaborations
A Linear Time Parameterized Algorithm for Node Unique Label Cover
The optimization version of the Unique Label Cover problem is at the heart of
the Unique Games Conjecture which has played an important role in the proof of
several tight inapproximability results. In recent years, this problem has been
also studied extensively from the point of view of parameterized complexity.
Cygan et al. [FOCS 2012] proved that this problem is fixed-parameter tractable
(FPT) and Wahlstr\"om [SODA 2014] gave an FPT algorithm with an improved
parameter dependence. Subsequently, Iwata, Wahlstr\"om and Yoshida [2014]
proved that the edge version of Unique Label Cover can be solved in linear
FPT-time. That is, there is an FPT algorithm whose dependence on the input-size
is linear. However, such an algorithm for the node version of the problem was
left as an open problem. In this paper, we resolve this question by presenting
the first linear-time FPT algorithm for Node Unique Label Cover
Odd multiway cut in directed acyclic graphs
We investigate the odd multiway node (edge) cut problem where the input is a graph with a specified collection of terminal nodes and the goal is to find a smallest subset of non-terminal nodes (edges) to delete so that the terminal nodes do not have an odd length path between them. In an earlier work, Lokshtanov and Ramanujan showed that both odd multiway node cut and odd multiway edge cut are fixed-parameter tractable (FPT) when parameterized by the size of the solution in undirected graphs. In this work, we focus on directed acyclic graphs (DAGs) and design a fixed-parameter algorithm. Our main contribution is a broadening of the shadow-removal framework to address parity problems in DAGs. We complement our FPT results with tight approximability as well as polyhedral results for 2 terminals in DAGs. Additionally, we show inapproximability results for odd multiway edge cut in undirected graphs even for 2 terminals
Integer programs with bounded subdeterminants and two nonzeros per row
We give a strongly polynomial-time algorithm for integer linear programs
defined by integer coefficient matrices whose subdeterminants are bounded by a
constant and that contain at most two nonzero entries in each row. The core of
our approach is the first polynomial-time algorithm for the weighted stable set
problem on graphs that do not contain more than vertex-disjoint odd cycles,
where is any constant. Previously, polynomial-time algorithms were only
known for (bipartite graphs) and for .
We observe that integer linear programs defined by coefficient matrices with
bounded subdeterminants and two nonzeros per column can be also solved in
strongly polynomial-time, using a reduction to -matching
Hypergraph matchings and designs
We survey some aspects of the perfect matching problem in hypergraphs, with
particular emphasis on structural characterisation of the existence problem in
dense hypergraphs and the existence of designs.Comment: 19 pages, for the 2018 IC
The tree packing conjecture for trees of almost linear maximum degree
We prove that there is such that for all sufficiently large , if
are any trees such that has vertices and maximum
degree at most , then packs into . Our main
result actually allows to replace the host graph by an arbitrary
quasirandom graph, and to generalize from trees to graphs of bounded degeneracy
that are rich in bare paths, contain some odd degree vertices, and only satisfy
much less stringent restrictions on their number of vertices.Comment: 150 pages, 4 figure
Single Commodity Flow Algorithms for Lifts of Graphic and Cographic Matroids
Consider a binary matroid M given by its matrix representation. We show that if M is a lift of a graphic or a cographic matroid, then in polynomial time we can either solve the single commodity flow problem for M or find an obstruction for which the Max-Flow Min-Cut relation does not hold. The key tool is an algorithmic version of Lehman's Theorem for the set covering polyhedron
- …