Approximation of the Shannon capacity via matrix cone programming

DOI10.1007/s40305-022-00408-6OpenAlexW4224212180MaRDI QIDQ6151010

Bo Bai, Zhongyi Huang, Zhennan Zhou, Shi-Tong Wu

Publication date: 9 February 2024

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-022-00408-6

zbMATH Keywords

Shannon capacityLovász numbermatrix cone programmingweak product property

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Applications of graph theory to circuits and networks (94C15) Coding theorems (Shannon theory) (94A24)

Cites Work

• Unnamed Item
• SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
• New lower bound on the Shannon capacity of \(C_7\) from circular graphs
• On upper bounding Shannon capacity of graph through generalized conic programming
• Copositivity cuts for improving SDP bounds on the clique number
• Approximation of the Stability Number of a Graph via Copositive Programming
• A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
• The Shannon capacity of a graph and the independence numbers of its powers
• A comparison of the Delsarte and Lovász bounds
• On the Shannon capacity of a graph
• On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• A Bound on the Shannon Capacity via a Linear Programming Variation
• SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
• Graphs and Geometry
• Computing the Stability Number of a Graph Via Linear and Semidefinite Programming