The following pages link to (Q4161330):
Displaying 13 items.
- Infeasibility of instance compression and succinct PCPs for NP (Q619903) (← links)
- The connection between the bump number problem and flow-shop scheduling with precedence constraints (Q753673) (← links)
- Toward a unified approach for the classification of NP-complete optimization problems (Q1143789) (← links)
- Probabilistic analysis for simple one- and two-dimensional bin packing algorithms (Q1149248) (← links)
- Non deterministic polynomial optimization problems and their approximations (Q1152215) (← links)
- Discrete extremal problems (Q1152306) (← links)
- General approximation algorithms for some arithmetical combinatorial problems (Q1158970) (← links)
- On the relationship between the biconnectivity augmentation and traveling salesman problems (Q1165162) (← links)
- Efficient Algorithms for (3,1) Graphs (Q1240742) (← links)
- An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs (Q1838978) (← links)
- Fast algorithms for bin packing (Q1845315) (← links)
- Probabilistic analysis of a network design problem heuristic (Q3705241) (← links)
- Worst-Case Analysis of Network Design Problem Heuristics (Q3964299) (← links)