Pages that link to "Item:Q4652632"

The following pages link to Approximating Maximum Clique by Removing Subgraphs (Q4652632):

Displaying 28 items.

• Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
• Algorithmic height compression of unordered trees (Q304776) (← links)
• Reoptimization of maximum weight induced hereditary subgraph problems (Q386899) (← links)
• The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
• Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
• Maximum cliques in graphs with small intersection number and random intersection graphs (Q826323) (← links)
• Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
• Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth (Q1041722) (← links)
• Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
• A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs (Q1652526) (← links)
• Ramsey theory and integrality gap for the independent set problem (Q1667206) (← links)
• Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
• Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem (Q1926502) (← links)
• In search of the densest subgraph (Q2005555) (← links)
• New tools and connections for exponential-time approximation (Q2272598) (← links)
• SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
• Approximating independent set in perturbed graphs (Q2446304) (← links)
• Finding large cliques in sparse semi-random graphs by simple randomized search heuristics (Q2455599) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs (Q2633284) (← links)
• On the independent set problem in random graphs (Q2804023) (← links)
• Approximating Independent Set and Coloring in Random Uniform Hypergraphs (Q3599156) (← links)
• On the Lovász Theta Function for Independent Sets in Sparse Graphs (Q4571926) (← links)
• (Q5075740) (← links)
• From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
• “Rent-or-Buy” Scheduling and Cost Coloring Problems (Q5458824) (← links)
• Parameterized inapproximability of independent set in \(H\)-free graphs (Q5925689) (← links)
• A fast approximation algorithm for the maximum 2-packing set problem on planar graphs (Q6110632) (← links)