Pages that link to "Item:Q4507337"
From MaRDI portal
The following pages link to Gadgets, Approximation, and Linear Programming (Q4507337):
Displaying 42 items.
- Chromatic kernel and its applications (Q266072) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- Bisections of graphs (Q461728) (← links)
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
- Efficient minimization of higher order submodular functions using monotonic Boolean functions (Q507571) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Differential approximation of MIN SAT, MAX SAT and related problems (Q877035) (← links)
- On the configuration LP for maximum budgeted allocation (Q896296) (← links)
- Non-approximability of weighted multiple sequence alignment. (Q1401267) (← links)
- On the hardness of efficiently approximating maximal non-\(L\) submatrices. (Q1418978) (← links)
- A manifesto for the computational method (Q1603721) (← links)
- Randomized competitive analysis for two server problems (Q1662430) (← links)
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems (Q1751224) (← links)
- The complexity of Boolean constraint satisfaction local search problems (Q1777392) (← links)
- Strong reductions for extended formulations (Q1801022) (← links)
- Improved approximations for max set splitting and max NAE SAT (Q1878408) (← links)
- Approximation algorithms for balancing signed graphs (Q2039689) (← links)
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function (Q2202007) (← links)
- Facets from gadgets (Q2220662) (← links)
- Max-bisections of \(H\)-free graphs (Q2279266) (← links)
- Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries (Q2379685) (← links)
- Large cuts with local algorithms on triangle-free graphs (Q2411507) (← links)
- Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689) (← links)
- Reductions, completeness and the hardness of approximability (Q2488898) (← links)
- New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover (Q2943894) (← links)
- On Khot’s unique games conjecture (Q3109809) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- Judicious partitions of directed graphs (Q3467583) (← links)
- Randomized Competitive Analysis for Two-Server Problems (Q3541083) (← links)
- Finding an Unknown Acyclic Orientation of a Given Graph (Q3557528) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- Some recent strong inapproximability results (Q5054856) (← links)
- Fast Distributed Approximation for Max-Cut (Q5056049) (← links)
- (Q5090427) (← links)
- (Q5090928) (← links)
- Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
- An Algorithmic Regularity Lemma for $L_p$ Regular Sparse Matrices (Q5371027) (← links)
- (Q5743406) (← links)
- Complexity classification of some edge modification problems (Q5948964) (← links)
- Max-Cut via Kuramoto-Type Oscillators (Q6168211) (← links)
- Complexity of maximum cut on interval graphs (Q6174803) (← links)
- On the complexity of binary polynomial optimization over acyclic hypergraphs (Q6174810) (← links)
