Pages that link to "Item:Q3841651"
From MaRDI portal
The following pages link to Approximate graph coloring by semidefinite programming (Q3841651):
Displaying 50 items.
- Quantum homomorphisms (Q257001) (← links)
- An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs (Q290195) (← links)
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- New heuristics for the vertex coloring problem based on semidefinite programming (Q351547) (← links)
- Constructing uniquely realizable graphs (Q393739) (← links)
- New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix (Q396873) (← links)
- Regular inference as vertex coloring (Q465248) (← links)
- Spectral bounds for the independence ratio and the chromatic number of an operator (Q466129) (← links)
- Price of anarchy for graph coloring games with concave payoff (Q501743) (← links)
- An axiomatic duality framework for the theta body and related convex corners (Q517307) (← links)
- A class of semidefinite programs with rank-one solutions (Q551300) (← links)
- Moment inequalities for sums of random matrices and their applications in optimization (Q647387) (← links)
- On approximating the longest path in a graph (Q679451) (← links)
- Computing the partition function for graph homomorphisms (Q681595) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- Wireless capacity with arbitrary gain matrix (Q742412) (← links)
- An improved algorithm for approximating the chromatic number of \(G_{n,p}\) (Q845732) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- A simple algorithm for 4-coloring 3-colorable planar graphs (Q974757) (← links)
- On the tractability of coloring semirandom graphs (Q975431) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Approximation algorithms for the weighted independent set problem in sparse graphs (Q1028454) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function (Q1375058) (← links)
- Approximating the independence number via the \(\vartheta\)-function (Q1380939) (← links)
- Laplacian eigenvalues and fixed size multisection (Q1422418) (← links)
- Semidefinite programming (Q1600854) (← links)
- Heuristics for semirandom graph problems (Q1604213) (← links)
- Solving graph coloring problems with the Douglas-Rachford algorithm (Q1653324) (← links)
- Sabidussi versus Hedetniemi for three variations of the chromatic number (Q1677539) (← links)
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164) (← links)
- Deciding \(k\)-colorability in expected polynomial time (Q1847370) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) (← links)
- The geometry of graphs and some of its algorithmic applications (Q1894703) (← links)
- Coloring the normalized Laplacian for oriented hypergraphs (Q1979369) (← links)
- A unified construction of semiring-homomorphic graph invariants (Q2052822) (← links)
- More tales of Hoffman: bounds for the vector chromatic number of a graph (Q2107750) (← links)
- Graph coloring and semidefinite rank (Q2164723) (← links)
- An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm (Q2176284) (← links)
- Vector coloring the categorical product of graphs (Q2191770) (← links)
- An SDP primal-dual algorithm for approximating the Lovász-theta function (Q2249741) (← links)
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
- On fractional cut covers (Q2312658) (← links)
- Spectral lower bounds for the orthogonal and projective ranks of a graph (Q2323822) (← links)
- Spectral lower bounds for the quantum chromatic number of a graph (Q2326333) (← links)
- Complexity of approximating bounded variants of optimization problems (Q2368970) (← links)
- Universal completability, least eigenvalue frameworks, and vector colorings (Q2408207) (← links)
- Graph homomorphisms via vector colorings (Q2422244) (← links)
- On the adaptable chromatic number of graphs (Q2427540) (← links)
