Pages that link to "Item:Q1380939"

The following pages link to Approximating the independence number via the \(\vartheta\)-function (Q1380939):

Displaying 40 items.

• Combinatorial optimization. Abstracts from the workshop held November 9--15, 2014. (Q347232) (← links)
• A quantitative version of Steinhaus' theorem for compact, connected, rank-one symmetric spaces (Q387573) (← links)
• Extremal results for odd cycles in sparse pseudorandom graphs (Q484999) (← links)
• On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
• Maximum cliques in graphs with small intersection number and random intersection graphs (Q826323) (← links)
• A heuristic for the stability number of a graph based on convex quadratic programming and tabu search (Q844531) (← links)
• On a restricted cross-intersection problem (Q855846) (← links)
• Semidefinite programming in combinatorial optimization (Q1365053) (← links)
• Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function (Q1375058) (← links)
• Heuristics for semirandom graph problems (Q1604213) (← links)
• Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164) (← links)
• Near-perfect clique-factors in sparse pseudorandom graphs (Q1792104) (← links)
• Deciding \(k\)-colorability in expected polynomial time (Q1847370) (← links)
• On approximation of max-vertex-cover (Q1848386) (← links)
• Ramsey numbers involving an odd cycle and large complete graphs in three colors (Q2093110) (← links)
• Independence and matching numbers of unicyclic graphs from null space (Q2176213) (← links)
• Null decomposition of unicyclic graphs (Q2197477) (← links)
• Orthonormal representations of \(H\)-free graphs (Q2207591) (← links)
• Complexity of approximating bounded variants of optimization problems (Q2368970) (← links)
• Extremal results in sparse pseudorandom graphs (Q2445889) (← links)
• On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178) (← links)
• Convex Relaxations and Integrality Gaps (Q2802523) (← links)
• Hypercontractive inequalities via SOS, and the Frankl--Rödl graph (Q2826231) (← links)
• Lovász, Vectors, Graphs and Codes (Q3295262) (← links)
• Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
• On the Lovász Theta Function for Independent Sets in Sparse Graphs (Q4571926) (← links)
• On Constant Time Approximation of Parameters of Bounded Degree Graphs (Q4933372) (← links)
• (Q5009505) (← links)
• (Q5075740) (← links)
• The Approximability of Assortment Optimization Under Ranking Preferences (Q5131544) (← links)
• A Sequence of Triangle-Free Pseudorandom Graphs (Q5366941) (← links)
• Near-perfect clique-factors in sparse pseudorandom graphs (Q5886099) (← links)
• Semidefinite programming and combinatorial optimization (Q5906394) (← links)
• Finding any given 2‐factor in sparse pseudorandom graphs efficiently (Q6055382) (← links)
• Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs (Q6074706) (← links)
• Making an H $H$‐free graph k $k$‐colorable (Q6093148) (← links)
• Local orthogonality dimension (Q6094036) (← links)
• New results for MaxCut in H$H$‐free graphs (Q6134889) (← links)
• Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← links)
• A note on pseudorandom Ramsey graphs (Q6192225) (← links)