:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Gmeiner, Simon, Schulz, Andreas S.
Format:	Preprint
Published:	2026
Subjects:	Combinatorics Computational Complexity 90C27
Online Access:	https://arxiv.org/abs/2602.11366
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Stable Set Polytopes with Rank $|V(G)|/3$ for the Lovász--Schrijver SDP Operator
by: Au, Yu Hin, et al.
Published: (2025)

Deriving differential approximation results for $k\,$CSPs from combinatorial designs
by: Culus, Jean-François, et al.
Published: (2024)

The n-vehicle exploration problem is NP-complete
by: Cui, Jinchuan, et al.
Published: (2023)

Computational complexity of sum-of-squares bounds for copositive programs
by: Palomba, Marilena, et al.
Published: (2025)

The rainbow covering number of clean tangled clutters
by: Abdi, Ahmad, et al.
Published: (2025)

Generalizations of Total Dual Integrality
by: Guenin, Bertrand, et al.
Published: (2025)

Shapley-Folkman-type Theorem for Integrally Convex Sets
by: Murota, Kazuo, et al.
Published: (2023)

Production optimization by agents of differing work rates
by: Higgins, Peter M.
Published: (2023)

Assignment-Routing Optimization : Efficient Heuristic Solver with Shaking Algorithm
by: Qilong, Yuan, et al.
Published: (2025)

A Computational Search for Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
by: Au, Yu Hin, et al.
Published: (2025)

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
by: Kim, Junyoung, et al.
Published: (2024)

Lexicographic Extensions preserve Euclideaness
by: Hochstättler, Winfried, et al.
Published: (2025)

Vertex-shellings of Euclidean Oriented Matroids
by: Hochstättler, Winfried, et al.
Published: (2023)

Semidefinite approximations for bicliques and biindependent pairs
by: Laurent, Monique, et al.
Published: (2023)

An efficient search strategy for hidden ideals in pointed partially ordered sets
by: Eisel, Roma, et al.
Published: (2025)

New Ramsey Multiplicity Bounds and Search Heuristics
by: Parczyk, Olaf, et al.
Published: (2022)

Steiner Cut Dominants
by: Conforti, Michele, et al.
Published: (2022)

Two Proofs of a Structural Theorem of Decreasing Minimization on Integrally Convex Sets
by: Murota, Kazuo, et al.
Published: (2025)

Convergence and efficiency proof of quantum imaginary time evolution for bounded order systems
by: Hartung, Tobias, et al.
Published: (2025)

Binary Cyclic Transversal Polytopes
by: Frede, Jonas, et al.
Published: (2024)

An Efficient and Almost Optimal Solver for the Joint Routing-Assignment Problem via Partial JRA and Large-α Optimization
by: Yuan, Qilong
Published: (2025)

Fulkerson duality for modulus of spanning trees and partitions
by: Truong, Huy, et al.
Published: (2023)

Matroid reinforcement and sparsification
by: Truong, Huy, et al.
Published: (2024)

On the Dual of the Solvency Cone
by: Löhne, Andreas, et al.
Published: (2014)

An Integer Linear Programming Model for the Evolomino Puzzle
by: Nikolaev, Andrei V., et al.
Published: (2026)

Mutations and (Non-)Euclideaness in oriented matroids
by: Wilhelmi, Michael
Published: (2025)

Integral bases, perfect matchings, and the Petersen graph
by: Abdi, Ahmad, et al.
Published: (2025)

Improved Bounds for the Ultimate Independence Ratio of Odd Wheels
by: Clow, Alexander, et al.
Published: (2025)

Finding Short Paths on Simple Polytopes
by: Black, Alexander E., et al.
Published: (2026)

Integral Biflow Maximization
by: Ding, Guoli, et al.
Published: (2024)

The $k$-fold circuit property for matroids
by: Jackson, Bill, et al.
Published: (2024)

Further results on the lower bound on reduced Zagreb index of trees
by: Bašić, Milan, et al.
Published: (2026)

Totally equimodular matrices: decomposition and triangulation
by: Chervet, Patrick, et al.
Published: (2025)

Base Modulus for Matroid Truncation, Strength, and Fractional Arboricity
by: Truong, Huy, et al.
Published: (2026)

Modulus for bases of matroids
by: Truong, Huy, et al.
Published: (2024)

Modulus of hypertrees
by: Truong, Huy, et al.
Published: (2025)

The Generalized Double Pouring Problem: Analysis, Bounds and Algorithms
by: Jäger, Gerold, et al.
Published: (2025)

Vanishing of Schubert coefficients is in ${\sf AM}\cap {\sf coAM}$ assuming the GRH
by: Pak, Igor, et al.
Published: (2025)

Vanishing of Schubert coefficients in probabilistic polynomial time
by: Pak, Igor, et al.
Published: (2025)

Signed double Roman domination on cubic graphs
by: Iurlano, Enrico, et al.
Published: (2023)