Pages that link to "Item:Q1184733"

The following pages link to On the complexity of approximating the independent set problem (Q1184733):

Displaying 38 items.

• Near-optimal nonapproximability results for some \textsc{Npo} PB-complete problems (Q293458) (← links)
• Kernel bounds for path and cycle problems (Q392032) (← links)
• A survey on the structure of approximation classes (Q458503) (← links)
• Solving the maximum edge biclique packing problem on unbalanced bipartite graphs (Q496657) (← links)
• Approximate solution of NP optimization problems (Q672315) (← links)
• Complexities of efficient solutions of rectilinear polygon cover problems (Q676264) (← links)
• On approximating the longest path in a graph (Q679451) (← links)
• On approximating four covering and packing problems (Q1021577) (← links)
• On the hardness of approximating max-satisfy (Q1045886) (← links)
• Optimization, approximation, and complexity classes (Q1186548) (← links)
• Approximating maximum independent sets by excluding subgraphs (Q1196452) (← links)
• Zero knowledge and the chromatic number (Q1276168) (← links)
• The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542) (← links)
• Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function (Q1375058) (← links)
• Approximating the independence number via the \(\vartheta\)-function (Q1380939) (← links)
• Clique is hard to approximate within \(n^{1-\epsilon}\) (Q1588908) (← links)
• Derandomized graph products (Q1842777) (← links)
• Tilt assembly: algorithms for micro-factories that build objects with uniform external forces (Q1986953) (← links)
• Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (Q2075363) (← links)
• On the analysis of optimization problems in arc-dependent networks (Q2172089) (← links)
• On constructing an optimal consensus clustering from multiple clusterings (Q2380012) (← links)
• On approximating the \(d\)-girth of a graph (Q2444552) (← links)
• Inapproximability results for the lateral gene transfer problem (Q2479568) (← links)
• Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
• Analyzing read-once cutting plane proofs in Horn systems (Q2673307) (← links)
• The biclique k-clustering problem in bipartite graphs and its application in bioinformatics (Q2883562) (← links)
• Expander graphs and their applications (Q3514498) (← links)
• The approximation of maximum subgraph problems (Q4630247) (← links)
• Polynomially bounded minimization problems which are hard to approximate (Q4630248) (← links)
• (Q5009505) (← links)
• Approximation of Constraint Satisfaction via local search (Q5057457) (← links)
• On approximating the longest path in a graph (Q5060133) (← links)
• From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
• Hardness and methods to solve CLIQUE (Q5959359) (← links)
• Structure in approximation classes (Q6085751) (← links)
• Reachability in choice networks (Q6108917) (← links)
• Unit read-once refutations for systems of difference constraints (Q6174656) (← links)
• A differentiable approach to the maximum independent set problem using dataless neural networks (Q6488722) (← links)