Imagen de Portada

Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Au, Yu Hin, Tunçel, Levent
Formato:	Preprint
Publicado:	2023
Materias:	Optimization and Control Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On Rank-Monotone Graph Operations and Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
por: Au, Yu Hin, et al.
Publicado: (2024)

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

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

On Connections Between Association Schemes and Analyses of Polyhedral and Positive Semidefinite Lift-and-Project Relaxations
por: Au, Yu Hin, et al.
Publicado: (2020)

Bond Polytope under Vertex- and Edge-sums
por: Kolman, Petr, et al.
Publicado: (2026)

Normalizations of factorizations over convex cones and their effects on extension complexity
por: Brown, Adam, et al.
Publicado: (2025)

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

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

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
por: Proença, Nathan Benedetto, et al.
Publicado: (2026)

An SDP Relaxation for the Sparse Integer Least Squares Problem
por: Del Pia, Alberto, et al.
Publicado: (2022)

Sparse Approximation in Lattices and Semigroups
por: Kuhlmann, Stefan, et al.
Publicado: (2024)

On Circuit Diameter Bounds via Circuit Imbalances
por: Dadush, Daniel, et al.
Publicado: (2021)

Valid Cuts for the Design of Potential-based Flow Networks
por: Börner, Pascal, et al.
Publicado: (2025)

Fair Schedules for Single Round Robin Tournaments with Ranked Participants
por: Wessel, Sten, et al.
Publicado: (2025)

Tight Bounds for the Maximum Distance Over a Polytope to a Given Point
por: Costandin, Marius, et al.
Publicado: (2023)

A Primal-Dual Extension of the Goemans--Williamson Algorithm for the Weighted Fractional Cut-Covering Problem
por: Proença, Nathan Benedetto, et al.
Publicado: (2023)

Generalized Cuts and Grothendieck Covers: a Primal-Dual Approximation Framework Extending the Goemans--Williamson Algorithm
por: Proença, Nathan Benedetto, et al.
Publicado: (2024)

Hamiltonicity of Schrijver graphs and stable Kneser graphs
por: Mütze, Torsten, et al.
Publicado: (2024)

Conformally rigid graphs
por: Steinerberger, Stefan, et al.
Publicado: (2024)

Diffusion-Robust Optimization over Graphs
por: Aolaritei, Liviu, et al.
Publicado: (2026)

Approximate Graph Colouring and the Crystal with a Hollow Shadow
por: Ciardo, Lorenzo, et al.
Publicado: (2022)

Cluster Assignment in Multi-Agent Systems
por: Sharf, Miel, et al.
Publicado: (2022)

Rank-one Boolean tensor factorization and the multilinear polytope
por: Del Pia, Alberto, et al.
Publicado: (2022)

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

Total Matching and Subdeterminants
por: Ferrarini, Luca, 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)

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

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

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

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

Integer programs with nearly totally unimodular matrices: the cographic case
por: Aprile, Manuel, et al.
Publicado: (2024)

Hierarchical threshold structure in Max-Cut with geometric edge weights
por: Marić, Nevena
Publicado: (2026)

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

Shortest Paths in Graphs of Convex Sets
por: Marcucci, Tobia, et al.
Publicado: (2021)

Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
por: Baeckelant, Timothy, et al.
Publicado: (2026)

Projection-width as a structural parameter for discrete separable optimization
por: Del Pia, Alberto
Publicado: (2025)

Minimum Cut Representability of Stable Matching Problems
por: Faenza, Yuri, et al.
Publicado: (2025)

Application of the Lovász-Schrijver Lift-and-Project Operator to Compact Stable Set Integer Programs
por: Battista, Federico, et al.
Publicado: (2024)

On complete classes of valuated matroids
por: Husić, Edin, et al.
Publicado: (2021)