The following pages link to (Q4470517):
Displaying 4 items.
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Max NP-completeness made easy (Q1960655) (← links)
- Parallel approximation of optimization problems (Q6560202) (← links)