Pages that link to "Item:Q1351453"

The following pages link to On an approximation measure founded on the links between optimization and polynomial approximation theory (Q1351453):

Displaying 37 items.

• Differential approximation algorithm of FSMVRP (Q277103) (← links)
• Differential approximation results for the traveling salesman and related problems (Q294874) (← links)
• Notes on inverse bin-packing problems (Q458387) (← links)
• A survey on the structure of approximation classes (Q458503) (← links)
• The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks (Q518934) (← links)
• Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
• Differential approximation schemes for half-product related functions and their scheduling applications (Q729806) (← links)
• A better differential approximation ratio for symmetric TSP (Q924134) (← links)
• Approximation results for the weighted \(P_4\) partition problem (Q935845) (← links)
• A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
• New differential approximation algorithm for \(k\)-customer vehicle routing problem (Q976133) (← links)
• Approximate solution of a resource-constrained scheduling problem (Q1009198) (← links)
• Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
• Differential approximation algorithms for some combinatorial optimization problems (Q1274917) (← links)
• A new lower bound on approximability of the ground state problem for tridimensional Ising spin glasses (Q1275602) (← links)
• Local approximations for maximum partial subgraph problem. (Q1426723) (← links)
• Differential approximation results for the Steiner tree problem (Q1431874) (← links)
• The maximum \(f\)-depth spanning tree problem (Q1603381) (← links)
• Relationship between superstring and compression measures: new insights on the greedy conjecture (Q1752482) (← links)
• The generalized vertex cover problem and some variations (Q1756348) (← links)
• Approximation algorithms for some vehicle routing problems (Q1765372) (← 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)
• Differential approximation for optimal satisfiability and related problems (Q1869721) (← links)
• Bridging gap between standard and differential polynomial approximation: The case of bin-packing (Q1961735) (← links)
• Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
• On a resource-constrained scheduling problem with application to distributed systems reconfiguration (Q2371345) (← links)
• Reductions, completeness and the hardness of approximability (Q2488898) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• Dual parameterization and parameterized approximability of subset graph problems (Q2969972) (← links)
• A branch-and-cut algorithm for a resource-constrained scheduling problem (Q3004200) (← links)
• An Improved Approximation Bound for Spanning Star Forest and Color Saving (Q3182915) (← links)
• Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
• Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
• Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)
• Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximationa (Q4831416) (← links)
• COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES (Q5714673) (← links)