Minimum Packing Constraint Violation

On the Best Interval Approximation Problem

This paper generalises the existing PTAS for complete graphs from a fixed to an arbitrary number of intervals and disprove an existing conjecture, which states that every instance of BIA admits a solution satisfying at least three quarters of all edges.

PeterBlohm, FlorianChen, A. Gionis et al. · 0 citations

A Formal Analysis of Why Heuristics Work

By formulating the problem from a Pattern Recognition perspective, PCT is used to present a mathematical, rigorous proof of this fact, and shows some uniqueness results on database query optimization techniques involving a few well-known histogram estimation methods.

Unknown authors · 0 citations

Preprint Sep 2026

A $59/33$ Cut-LP Guarantee for Matching Augmentation

A new structural analysis of the Bamas--Drygala--Svensson LP-guided DFS algorithm is given, which combines an exact primal--dual identity for the residual uplink problem with a rank bound that measures fractional support relative to the unit-valued skeleton.

Morteza Alimi, Tobias Mömke · 0 citations

Preprint Aug 2026

Exact SAT Solving for the Two-Dimensional Bandwidth Minimization Problem

The results demonstrate that the proposed SAT approach provides an effective exact method for the small- and medium-sized benchmark instances considered in this study, with fewer than 400 vertices, while heuristic methods remain important for larger and more challenging instances.

Minh Quang Pham, Dao Xuan Nghia, T. Van-Khanh · 0 citations

Coarse Grained Parallel Fixed-Parameter Tractable Algorithms (cid:3)

This paper shows how to enhance this approach through the addition of parallelism, thereby allowing even larger problem instances to be solved in practice, and demonstrates the potential of parallelism when applied to the bounded tree search phase of FPT algorithms.

F. Dehne, A. Rau-Chaplin, U. Stege et al. · 0 citations

Preprint Sep 2026

On the Tightness of Standard Relaxations for Mixed-Integer Bilevel Linear Programs

It is proved that neither the SLR itself nor its associated upper bound admits a uniform improvement by a polynomial-time algorithm with access to a mixed-integer linear programming (MILP) oracle, which rules out uniform improvements by iterative MILP-based approaches, including cutting-plane-based and decomposition al...

Sergey S. Ketkov, O. Prokopyev · 0 citations