ε-optimization schemes and L-bit precision: Alternative perspectives in combinatorial optimization (extended abstract)

Keyphrases

• Optimization Scheme 100%
• Combinatorial Optimization 100%
• Extended Abstracts 100%
• Bit Precision 100%
• NP-hard Problem 50%
• Polynomial Time 25%
• Polynomial-time Algorithm 25%
• Algorithm Design 25%
• Timing Optimization 25%
• Distance Measure 25%
• Algorithm Analysis 25%
• P-NP 25%
• Fully Polynomial Time Approximation Scheme 25%
• Relative Error 25%
• Precision Model 25%
• Negative Value 25%
• Imprecise Data 25%
• Real-time Optimization 25%
• Approximation Scheme 25%
• Polynomial Time Solvability 25%

Mathematics

• Objective Function 100%
• NP-hard Problem 100%
• Polynomial Time 100%
• Combinatorial Optimization 100%
• Relative Error 50%
• Optimality 50%
• Worst Case 50%
• Solvability 50%
• Negative Value 50%
• Fully Polynomial-Time Approximation Scheme 50%

Computer Science

• Combinatorial Optimisation 100%
• Objective Function 100%
• Polynomial Time 100%
• Optimization Problem 50%
• Algorithm Design 50%
• Fully Polynomial-Time Approximation Scheme 50%
• approximation scheme 50%
• Relative Error 50%
• Negative Value 50%