Image de couverture de livre

Dual Bounded Generation: Polynomial, Second-order Cone and Positive Semidefinite Matrix Inequalities

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Elbassioni, Khaled
Format:	Preprint
Publié:	2024
Sujets:	Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
par: Elbassioni, Khaled
Publié: (2025)

Two-person Positive Shortest Path Games Have Nash Equilibria in Pure Stationary Strategies
par: Boros, Endre, et autres
Publié: (2024)

Polynomial Bounds in the Apex Minor Theorem
par: Hendrey, Kevin, et autres
Publié: (2025)

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

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality
par: Laddha, Aditi, et autres
Publié: (2025)

Monotone Bounded-Depth Complexity of Homomorphism Polynomials
par: Bhargav, C. S., et autres
Publié: (2025)

From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP
par: Gurvits, Leonid, et autres
Publié: (2023)

Asymptotic Bounds and Online Algorithms for Average-Case Matrix Discrepancy
par: Kunisky, Dmitriy, et autres
Publié: (2024)

Polynomial-Size Enumeration Kernelizations for Long Path Enumeration
par: Komusiewicz, Christian, et autres
Publié: (2025)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
par: Proença, Nathan Benedetto, et autres
Publié: (2026)

On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
par: Bandopadhyay, Susobhan, et autres
Publié: (2023)

Isoperimetric Inequalities Made Simpler
par: Eldan, Ronen, et autres
Publié: (2022)

Bears with Hats and Independence Polynomials
par: Blažej, Václav, et autres
Publié: (2021)

Graphs, Disjoint Matchings and Some Inequalities
par: Hambardzumyan, Lianna, et autres
Publié: (2015)

A Euclidean Distance Matrix Model for Convex Clustering
par: Wang, Zhaowei, et autres
Publié: (2021)

Another Way to Lower the Bound for Distinct Squares
par: Tomita, Eitatsu, et autres
Publié: (2026)

Improved Lower Bounds on Multiflow-Multicut Gaps
par: Kalantarzadeh, Sina, et autres
Publié: (2025)

Hypergraphs with Polynomial Representation: Introducing $r$-splits
par: Pitois, François, et autres
Publié: (2022)

Positional Identifiability from Pairwise Collision Data
par: Li, Yun-Han, et autres
Publié: (2026)

Weighted Treedepth is NP-complete on Graphs of Bounded Degree
par: Dirks, Jona, et autres
Publié: (2025)

Using Graph Theory to Derive Inequalities for the Bell Numbers
par: Hertz, Alain, et autres
Publié: (2021)

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
par: Ai, Jiangdong, et autres
Publié: (2024)

Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem
par: Dubinsky, Manuel, et autres
Publié: (2024)

An orderly algorithm for generation of Condorcet Domains
par: Zhou, Bei, et autres
Publié: (2025)

Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
par: Gerke, Stefanie, et autres
Publié: (2024)

Digraph Branchings and Matrix Determinants
par: Ghosh, Sayani, et autres
Publié: (2023)

Weighted Group Search on the Disk & Improved Lower Bounds for Priority Evacuation
par: Georgiou, Konstantinos, et autres
Publié: (2024)

A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering
par: Kawamura, Akitoshi, et autres
Publié: (2025)

Polynomial-time recognition and maximum independent set in Burling graphs
par: Rzążewski, Paweł, et autres
Publié: (2024)

Unique-neighbor Expanders with Better Expansion for Polynomial-sized Sets
par: Chen, Yeyuan
Publié: (2024)

Axiomatic characterizations of dissimilarity orderings and distances between sets
par: Marchant, Thierry, et autres
Publié: (2025)

A Polynomial Kernel for Proper Helly Circular-arc Vertex Deletion
par: Agrawal, Akanksha, et autres
Publié: (2024)

Single machine rescheduling for new orders: properties and complexity results
par: Rener, Elena, et autres
Publié: (2023)

Bounds on Path Energy of Graphs
par: Narke, Amol P., et autres
Publié: (2022)

Computation of Graph Polynomials via Tree Decomposition: Theory, Algorithms, and Python Implementation
par: Bafna, Mehul, et autres
Publié: (2025)

Density Decomposition in Dual-Modular Optimization: Markets, Fairness, and Contracts
par: Chan, T-H. Hubert, et autres
Publié: (2025)

Bounds on the Complete Forcing Number of Graphs
par: Ebrahimi, Javad B., et autres
Publié: (2024)

Bounds on Linear Turán Number for Trees
par: Adak, Rajat, et autres
Publié: (2026)

Lower Bounds for Induced-Universal Graphs
par: Gavoille, Cyril, et autres
Publié: (2025)

Supports for Outerplanar and Bounded Treewidth Graphs
par: Raman, Rajiv, et autres
Publié: (2025)