Pages that link to "Item:Q1386460"
From MaRDI portal
The following pages link to Parallel approximation algorithms by positive linear programming (Q1386460):
Displaying 26 items.
- Parallel approximation of min-max problems (Q354658) (← links)
- Improved parallel approximation of a class of integer programming problems (Q676274) (← links)
- Affine reductions for LPs and SDPs (Q1717229) (← links)
- The approximability of non-Boolean satisfiability problems and restricted integer programming (Q1770383) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Approximation in (Poly-) logarithmic space (Q2037114) (← links)
- Oblivious algorithms for the maximum directed cut problem (Q2346965) (← links)
- The complexity of linear programming in \((\gamma ,\kappa )\)-form (Q2380073) (← links)
- On the approximability of digraph ordering (Q2408167) (← links)
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence (Q2414908) (← links)
- Simultaneous Approximation of Constraint Satisfaction Problems (Q3448785) (← links)
- Approximating CSPs Using LP Relaxation (Q3448840) (← links)
- Parallel approximation to high multiplicity scheduling problems<i>VIA</i>smooth multi-valued quadratic programming (Q3515460) (← links)
- (Q4875177) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (Q5002610) (← links)
- Near-optimal NP-hardness of approximating \textsc{Max} \(k\)-\(\mathrm{CSP}_R\) (Q5077145) (← links)
- Approximation in (Poly-) Logarithmic Space (Q5089177) (← links)
- (Q5091725) (← links)
- Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program (Q5231683) (← links)
- (Q5497122) (← links)
- On the parallel approximability of a subclass of quadratic programming. (Q5941277) (← links)
- Building a small and informative phylogenetic supertree (Q6077843) (← links)
- On parallel versus sequential approximation (Q6102318) (← links)
- On maximizing sums of non-monotone submodular and linear functions (Q6130322) (← links)
- Revisiting maximum satisfiability and related problems in data streams (Q6199395) (← links)