Pages that link to "Item:Q4178914"
From MaRDI portal
The following pages link to On the Shannon capacity of a graph (Q4178914):
Displaying 50 items.
- A projected gradient algorithm for solving the maxcut SDP relaxation (Q2770188) (← links)
- Semi-definite positive programming relaxations for graph \(K_n\)-coloring in frequency assignment. (Q2773169) (← links)
- A comprehensive analysis of polyhedral lift-and-project methods (Q2790405) (← links)
- Matrix convex hulls of free semialgebraic sets (Q2790584) (← links)
- Exponential lower bounds for polytopes in combinatorial optimization (Q2796404) (← links)
- Convex Hulls of Algebraic Sets (Q2802521) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- Relaxations of Combinatorial Problems Via Association Schemes (Q2802525) (← links)
- Invariant Semidefinite Programs (Q2802527) (← links)
- Projection Methods in Conic Optimization (Q2802538) (← links)
- Semidefinite Programming and Constraint Programming (Q2802541) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
- Removal and stability for Erdős-Ko-Rado (Q2808164) (← links)
- Maximum privacy without coherence, zero-error (Q2825546) (← links)
- Hypercontractive inequalities via SOS, and the Frankl-Rödl graph (Q2826231) (← links)
- Lovász-Schrijver PSD-Operator on Claw-Free Graphs (Q2835662) (← links)
- A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs (Q2835666) (← links)
- Strengthening Chvátal-Gomory Cuts for the Stable Set Problem (Q2835677) (← links)
- Spectral upper bounds on the size of \(k\)-regular induced subgraphs (Q2839204) (← links)
- Some advances on lovász-schrijver \(N_+(\cdot)\) relaxations of the fractional stable set polytope (Q2840707) (← links)
- Near-perfect graphs with polyhedral \(N_+(G)\) (Q2840742) (← links)
- Permutation capacities and oriented infinite paths (Q2857343) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2857431) (← links)
- Primal–dual first-order methods for a class of cone programming (Q2867434) (← links)
- Fourier Analysis on Finite Groups and the Lovász ϑ-Number of Cayley Graphs (Q2875531) (← links)
- Vector representation of graph domination (Q2888886) (← links)
- Grothendieck-type inequalities in combinatorial optimization (Q2892967) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms (Q2949518) (← links)
- Linear programing relaxations for a strategic pricing problem in electricity markets (Q2968496) (← links)
- Characterizing N+-perfect line graphs (Q2968506) (← links)
- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145) (← links)
- Sum of squares basis pursuit with linear and second order cone programming (Q2979646) (← links)
- A New Approach to the Stable Set Problem Based on Ellipsoids (Q3009765) (← links)
- Gap, cosum and product properties of the θ′ bound on the clique number (Q3066919) (← links)
- On LP-based approximation for copositive formulation of stable set problem (Q3121395) (← links)
- Grothendieck inequalities for semidefinite programs with rank constraint (Q3191609) (← links)
- Lovász and Schrijver $$N_+$$-Relaxation on Web Graphs (Q3195330) (← links)
- An Analogue of the Shannon Capacity of a Graph (Q3204507) (← links)
- Lovász, Vectors, Graphs and Codes (Q3295262) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- A general method to obtain the spectrum and local spectra of a graph from its regular partitions (Q3299352) (← links)
- Coloring the Voronoi tessellation of lattices (Q3384034) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
- (Q3410616) (← links)
- Shannon zero error capacity in the problems of state estimation and stabilization via noisy communication channels (Q3423783) (← links)
- Clique, chromatic, and Lovász numbers of certain circulant graphs (Q3439129) (← links)
- A “simple” rectangular puzzle (Q3439613) (← links)
- On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844) (← links)
