Pages that link to "Item:Q1877696"

The following pages link to On the approximability of clique and related maximization problems (Q1877696):

Displaying 19 items.

• Correction to: ``Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts'' (Q1634803) (← links)
• \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (Q1804563) (← links)
• On the query complexity of clique size and maximum satisfiability (Q1816736) (← links)
• A clique search problem and its application to machine scheduling (Q2068853) (← links)
• Maximizing happiness in graphs of bounded clique-width (Q2081605) (← links)
• Worst-case analysis of clique MIPs (Q2089781) (← links)
• On the maxima of Motzkin-Straus programs and cliques of graphs (Q2089888) (← links)
• Approximation and inapproximability results for maximum clique of disc graphs in high dimensions (Q2380046) (← links)
• LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs (Q2921429) (← links)
• Linear degree extractors and the inapproximability of max clique and chromatic number (Q2931428) (← links)
• (Q3112179) (← links)
• On CLIQUE Problem for Sparse Graphs of Large Dimension (Q3463541) (← links)
• Approximation Algorithms for the <i>k</i>-Clique Covering Problem (Q4895634) (← links)
• (Q5028364) (← links)
• Fast Heuristics and Approximation Algorithms (Q5050148) (← links)
• Hardness magnification near state-of-the-art lower bounds (Q5091779) (← links)
• Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width (Q5173247) (← links)
• On approximating the number of k-cliques in sublinear time (Q5230333) (← links)
• (Q5687255) (← links)