The following pages link to (Q4764626):
Displayed 27 items.
- Near-optimal nonapproximability results for some \textsc{Npo} PB-complete problems (Q293458) (← links)
- Matrix sparsification and the sparse null space problem (Q329287) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- Paths, trees and matchings under disjunctive constraints (Q643009) (← links)
- A quantum walk-assisted approximate algorithm for bounded NP optimisation problems (Q669949) (← links)
- Finding disjoint paths with related path costs (Q857785) (← links)
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← links)
- The complexity of makespan minimization for pipeline transportation. (Q1426458) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
- Some APX-completeness results for cubic graphs (Q1566710) (← links)
- Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights (Q1575713) (← links)
- Scheduling on parallel machines with preemption and transportation delays (Q1761986) (← links)
- Analyzing unit read-once refutations in difference constraint systems (Q2055789) (← links)
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (Q2075363) (← links)
- Analyzing the reachability problem in choice networks (Q2170221) (← links)
- On the analysis of optimization problems in arc-dependent networks (Q2172089) (← links)
- Minimal distance of propositional models (Q2322705) (← links)
- Analyzing read-once cutting plane proofs in Horn systems (Q2673307) (← links)
- On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem (Q2773025) (← links)
- Approximating Alternative Solutions (Q3511329) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
- Structure in approximation classes (Q6085751) (← links)
- On the approximability of path and cycle problems in arc-dependent networks (Q6102285) (← links)
- Reachability in choice networks (Q6108917) (← links)
- Optimal length cutting plane refutations of integer programs (Q6174433) (← links)
- Unit read-once refutations for systems of difference constraints (Q6174656) (← links)