Pages that link to "Item:Q1143789"

The following pages link to Toward a unified approach for the classification of NP-complete optimization problems (Q1143789):

Displaying 17 items.

• Approximate solution of NP optimization problems (Q672315) (← links)
• Local search, reducibility and approximability of NP-optimization problems (Q673464) (← links)
• Improving known solutions is hard (Q687508) (← links)
• Detection and localization of hidden radioactive sources with spatial statistical method (Q763204) (← links)
• Completeness in approximation classes (Q811119) (← links)
• Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
• A better differential approximation ratio for symmetric TSP (Q924134) (← links)
• On different approximation criteria for subset product problems (Q1076608) (← links)
• On the complexity of approximating the independent set problem (Q1184733) (← links)
• Optimization, approximation, and complexity classes (Q1186548) (← links)
• Quantifiers and approximation (Q1208413) (← links)
• New local search approximation techniques for maximum generalized satisfiability problems (Q1351586) (← links)
• On the differential approximation of MIN SET COVER (Q1770405) (← links)
• Differential approximation results for the traveling salesman problem with distances 1 and 2 (Q1869490) (← links)
• Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
• An Improved Approximation Bound for Spanning Star Forest and Color Saving (Q3182915) (← links)
• On the complexity of approximating the independent set problem (Q5096160) (← links)