Pages that link to "Item:Q1350605"
From MaRDI portal
The following pages link to Approximability of maximum splitting of k-sets and some other Apx-complete problems (Q1350605):
Displaying 9 items.
- Orienting graphs to optimize reachability (Q290248) (← links)
- Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat} (Q293272) (← links)
- Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
- Improved parameterized set splitting algorithms: A Probabilistic approach (Q1040647) (← links)
- On the hardness of efficiently approximating maximal non-\(L\) submatrices. (Q1418978) (← links)
- On weighted vs unweighted versions of combinatorial optimization problems (Q1854428) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Improved approximations for max set splitting and max NAE SAT (Q1878408) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
