Image de couverture de livre

On Circuit Diameter Bounds via Circuit Imbalances

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento, Végh, László A.
Format:	Preprint
Publié:	2021
Sujets:	Optimization and Control Discrete Mathematics Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On Circuit Diameter and Straight Line Complexity
par: Dadush, Daniel, et autres
Publié: (2026)

Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure
par: Dadush, Daniel, et autres
Publié: (2025)

On complete classes of valuated matroids
par: Husić, Edin, et autres
Publié: (2021)

Circuit Diameter of Polyhedra is Strongly Polynomial
par: Natura, Bento
Publié: (2026)

Arithmetic Circuits and Neural Networks for Regular Matroids
par: Hertrich, Christoph, et autres
Publié: (2025)

Bond Polytope under Vertex- and Edge-sums
par: Kolman, Petr, et autres
Publié: (2026)

Sparse Approximation in Lattices and Semigroups
par: Kuhlmann, Stefan, et autres
Publié: (2024)

Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator
par: Au, Yu Hin, et autres
Publié: (2023)

On Rank-Monotone Graph Operations and Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
par: Au, Yu Hin, et autres
Publié: (2024)

On Connections Between Association Schemes and Analyses of Polyhedral and Positive Semidefinite Lift-and-Project Relaxations
par: Au, Yu Hin, et autres
Publié: (2020)

Valid Cuts for the Design of Potential-based Flow Networks
par: Börner, Pascal, et autres
Publié: (2025)

An Explicit Formula for Vertex Enumeration in the CUT(n) Polytope via Probabilistic Methods
par: Marić, Nevena
Publié: (2025)

Polytopes of alternating sign matrices with dihedral-subgroup symmetry
par: Madarasi, Péter
Publié: (2026)

Interior point methods are not worse than Simplex
par: Allamigeon, Xavier, et autres
Publié: (2022)

Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem
par: Fujiwara, Hiroshi, et autres
Publié: (2025)

Cluster Assignment in Multi-Agent Systems
par: Sharf, Miel, et autres
Publié: (2022)

Conformally rigid graphs
par: Steinerberger, Stefan, et autres
Publié: (2024)

Diffusion-Robust Optimization over Graphs
par: Aolaritei, Liviu, et autres
Publié: (2026)

Approximate Graph Colouring and the Crystal with a Hollow Shadow
par: Ciardo, Lorenzo, et autres
Publié: (2022)

Complexity of polytope diameters via perfect matchings
par: Nöbel, Christian, et autres
Publié: (2024)

Vertex-ordering and arc-partitioning problems
par: Borsik, Nóra A., et autres
Publié: (2025)

Separable convex optimization over indegree polytopes
par: Borsik, Nóra A., et autres
Publié: (2025)

Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
par: Baeckelant, Timothy, et autres
Publié: (2026)

Prefix-bounded matrices
par: Borsik, Nóra A., et autres
Publié: (2025)

Integer programs with bounded subdeterminants and two nonzeros per row
par: Fiorini, Samuel, et autres
Publié: (2021)

Fair Schedules for Single Round Robin Tournaments with Ranked Participants
par: Wessel, Sten, et autres
Publié: (2025)

On the Congruency-Constrained Matroid Base
par: Liu, Siyue, et autres
Publié: (2023)

Integer programs with nearly totally unimodular matrices: the cographic case
par: Aprile, Manuel, et autres
Publié: (2024)

Hierarchical threshold structure in Max-Cut with geometric edge weights
par: Marić, Nevena
Publié: (2026)

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

Total Matching and Subdeterminants
par: Ferrarini, Luca, et autres
Publié: (2023)

Asymptotic Bounds for the Traveling Salesman Problem with Drone
par: Lee, Jae Hyeok, et autres
Publié: (2026)

Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees
par: Koh, Zhuan Khye, et autres
Publié: (2021)

Tight Bounds for the Maximum Distance Over a Polytope to a Given Point
par: Costandin, Marius, et autres
Publié: (2023)

Gromov's Approximating Tree and the All-Pairs Bottleneck Paths Problem
par: Cornect, Anders, et autres
Publié: (2024)

Neural Networks and (Virtual) Extended Formulations
par: Hertrich, Christoph, et autres
Publié: (2024)

Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
par: Lozano, Leonardo, et autres
Publié: (2022)

Diameter of the inversion graph
par: Havet, Frédéric, et autres
Publié: (2024)

On the Correlation Gap of Matroids
par: Husić, Edin, et autres
Publié: (2022)

Bounding Width on Graph Classes of Constant Diameter
par: Dabrowski, Konrad K., et autres
Publié: (2025)