The following pages link to z-Approximations (Q2775899):
Displaying 24 items.
- Differential approximation algorithm of FSMVRP (Q277103) (← links)
- Differential approximation results for the traveling salesman and related problems (Q294874) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- A better differential approximation ratio for symmetric TSP (Q924134) (← links)
- Approximation results for the weighted \(P_4\) partition problem (Q935845) (← links)
- New differential approximation algorithm for \(k\)-customer vehicle routing problem (Q976133) (← links)
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- Domination analysis of combinatorial optimization problems. (Q1406045) (← links)
- Local approximations for maximum partial subgraph problem. (Q1426723) (← links)
- The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
- Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis (Q1728217) (← links)
- Approximation algorithms for some vehicle routing problems (Q1765372) (← links)
- On the differential approximation of MIN SET COVER (Q1770405) (← links)
- The maximum saving partition problem (Q1779697) (← links)
- Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
- An Improved Approximation Bound for Spanning Star Forest and Color Saving (Q3182915) (← links)
- (Q3385394) (← links)
- Towards a theory of practice in metaheuristics design: A machine learning perspective (Q3431446) (← links)
- Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
- COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES (Q5714673) (← links)
