Imagen de Portada

Integer programs with nearly totally unimodular matrices: the cographic case

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Aprile, Manuel, Fiorini, Samuel, Joret, Gwenaël, Kober, Stefan, Seweryn, Michał T., Weltge, Stefan, Yuditsky, Yelena
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics Discrete Mathematics Data Structures and Algorithms Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Integer programs with bounded subdeterminants and two nonzeros per row
por: Fiorini, Samuel, et al.
Publicado: (2021)

Total Matching and Subdeterminants
por: Ferrarini, Luca, et al.
Publicado: (2023)

Totally $Δ$-modular IPs with two non-zeros in most rows
por: Kober, Stefan
Publicado: (2024)

Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack
por: Schade, Jamico, et al.
Publicado: (2023)

Face covers and rooted minors in bounded genus graphs
por: Fiorini, Samuel, et al.
Publicado: (2025)

Prefix-bounded matrices
por: Borsik, Nóra A., et al.
Publicado: (2025)

Multiplicative assignment with upgrades
por: Armbruster, Alexander, et al.
Publicado: (2025)

Pathwidth vs cocircumference
por: Briański, Marcin, et al.
Publicado: (2023)

Vertex-ordering and arc-partitioning problems
por: Borsik, Nóra A., et al.
Publicado: (2025)

Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem
por: Fujiwara, Hiroshi, et al.
Publicado: (2025)

Separable convex optimization over indegree polytopes
por: Borsik, Nóra A., et al.
Publicado: (2025)

On the Congruency-Constrained Matroid Base
por: Liu, Siyue, et al.
Publicado: (2023)

Complexity of polytope diameters via perfect matchings
por: Nöbel, Christian, et al.
Publicado: (2024)

Computational Verification of the Buratti--Horak--Rosa Conjecture for Small Integers and Inductive Approaches
por: Naik, Ranjan N
Publicado: (2025)

Circulant TSP: Vertices of the Edge-Length Polytope and Superpolynomial Lower Bounds
por: Gutekunst, Samuel C.
Publicado: (2025)

Efficient Local and Tabu Search Strategies for Large-Scale Quadratic Integer Programming
por: Wang, Haibo, et al.
Publicado: (2024)

Coarse Balanced Separators in Fat-Minor-Free Graphs
por: Bonnet, Édouard, et al.
Publicado: (2026)

Efficient approximation schemes for scheduling on a stochastic number of machines
por: Epstein, Leah, et al.
Publicado: (2024)

Algorithmic aspects of semistability of quiver representations
por: Iwamasa, Yuni, et al.
Publicado: (2024)

NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability
por: Kar, Prem Nigam, et al.
Publicado: (2024)

A Θ(m^9) ternary minimum-cost network flow LP model of the Assignment Problem polytope with applications to hard combinatorial optimization problems
por: Diaby, Moustapha
Publicado: (2016)

Variants of Merge-Width and Applications
por: Drabik, Karolina, et al.
Publicado: (2026)

A New and Faster Representation for Counting Integer Points in Parametric Polyhedra
por: Gribanov, D., et al.
Publicado: (2023)

A near-optimal zero-free disk for the Ising model
por: Patel, Viresh, et al.
Publicado: (2023)

The Central Spanning Tree Problem
por: Sanmartín, Enrique Fita, et al.
Publicado: (2024)

Deterministic approximate counting of colorings with fewer than $2Δ$ colors via absence of zeros
por: Bencs, Ferenc, et al.
Publicado: (2024)

The Strong Birthday Problem Revisited
por: Tripathy, Chijul B.
Publicado: (2025)

Reconfiguration of List Colourings
por: Cambie, Stijn, et al.
Publicado: (2025)

Parameterized complexity of isometric path partition: treewidth and diameter
por: Chakraborty, Dibyayan, et al.
Publicado: (2025)

On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
por: Ghanbari, Babak, et al.
Publicado: (2025)

On the Enumeration of all Unique Paths of Recombining Trinomial Trees
por: Torres, Ethan, et al.
Publicado: (2025)

Vigemers: on the number of $k$-mers sharing the same XOR-based minimizer
por: Ingels, Florian, et al.
Publicado: (2026)

Induced Cycles of Many Lengths
por: Chudnovsky, Maria, et al.
Publicado: (2026)

Approximating maximum-size properly colored forests
por: Bai, Yuhang, et al.
Publicado: (2024)

Problems on Group-labeled Matroid Bases
por: Hörsch, Florian, et al.
Publicado: (2024)

$α_i$-Metric Graphs: Hyperbolicity
por: Dragan, Feodor F., et al.
Publicado: (2024)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
por: Deák, Bence, et al.
Publicado: (2026)

Rainbow Arborescence Conjecture
por: Bérczi, Kristóf, et al.
Publicado: (2024)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
por: An, Shinwoo, et al.
Publicado: (2025)

Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
por: Holtgrefe, Niels, et al.
Publicado: (2024)