Pages that link to "Item:Q811119"

The following pages link to Completeness in approximation classes (Q811119):

Displaying 44 items.

• Differential approximation results for the traveling salesman and related problems (Q294874) (← links)
• A survey on the structure of approximation classes (Q458503) (← links)
• Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287) (← links)
• Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness (Q557903) (← links)
• Approximate solution of NP optimization problems (Q672315) (← links)
• Local search, reducibility and approximability of NP-optimization problems (Q673464) (← links)
• Structure of polynomial-time approximation (Q692893) (← links)
• Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
• Optimization, approximation, and complexity classes (Q1186548) (← links)
• Quantifiers and approximation (Q1208413) (← links)
• On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← links)
• Integer programming as a framework for optimization and approximability (Q1276163) (← links)
• A short note on the approximability of the maximum leaves spanning tree problem (Q1336751) (← links)
• The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542) (← links)
• On the approximability of some Maximum Spanning Tree Problems (Q1391300) (← links)
• On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
• Some APX-completeness results for cubic graphs (Q1566710) (← links)
• Structural properties of bounded relations with an application to NP optimization problems (Q1589424) (← links)
• Classes bounded by incomplete sets (Q1602854) (← links)
• The maximum \(f\)-depth spanning tree problem (Q1603381) (← links)
• The essence of ideal completion in quantitative form (Q1605177) (← links)
• The complexity of theory revision (Q1606294) (← links)
• On the Hamming distance of constraint satisfaction problems. (Q1853512) (← links)
• Max NP-completeness made easy (Q1960655) (← links)
• Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
• On approximation scheme preserving reducibility and its applications (Q1969434) (← links)
• The generalized definitions of the two-dimensional largest common substructure problems (Q2182100) (← links)
• Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
• Reductions, completeness and the hardness of approximability (Q2488898) (← links)
• Minimum monopoly in regular and tree graphs (Q2497525) (← links)
• Completeness in approximation classes beyond APX (Q2503307) (← links)
• Local Monotonicity in Probabilistic Networks (Q3524964) (← links)
• Completeness in approximation classes (Q3974859) (← links)
• Towards and syntactic characterization of PTAS (Q4228486) (← links)
• Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
• Polynomially bounded minimization problems which are hard to approximate (Q4630248) (← links)
• (Q4801277) (← links)
• On the approximability of some maximum spanning tree problems (Q5096340) (← links)
• (Q5457562) (← links)
• (Q5475071) (← links)
• Algorithms and Computation (Q5712104) (← links)
• COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES (Q5714673) (← links)
• Approximation of some NP-hard optimization problems by finite machines, in probability (Q5941283) (← links)
• Structure in approximation classes (Q6085751) (← links)