Pages that link to "Item:Q4819698"

The following pages link to Algorithms with large domination ratio (Q4819698):

Displaying 26 items.

• Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
• A probabilistic approach to problems parameterized above or below tight bounds (Q632807) (← links)
• Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
• Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width (Q713329) (← links)
• Domination analysis for minimum multiprocessor scheduling (Q858313) (← links)
• Dominance guarantees for above-average solutions (Q937396) (← links)
• Algorithmic aspects of majority domination (Q1371054) (← links)
• The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
• Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis (Q1728217) (← links)
• Tournament quasirandomness from local counting (Q2036620) (← links)
• Parameterized complexity of satisfying almost all linear equations over \(\mathbb F_2\) (Q2392244) (← links)
• Hamilton decompositions of regular expanders: applications (Q2434714) (← links)
• Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
• A domination algorithm for \(\{0,1\}\)-instances of the travelling salesman problem (Q2811158) (← links)
• Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
• Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
• Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System (Q2971639) (← links)
• A Probabilistic Approach to Problems Parameterized above or below Tight Bounds (Q3656865) (← links)
• Anticoncentration for subgraph statistics (Q4967964) (← links)
• Edge-statistics on large graphs (Q4993086) (← links)
• (Q4993600) (← links)
• Fast Heuristics and Approximation Algorithms (Q5050148) (← links)
• On the advantage over a random assignment (Q5894908) (← links)
• Quadratic forms on graphs (Q5896810) (← links)
• Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture (Q6049024) (← links)
• The inertia bound is far from tight (Q6634558) (← links)