Pages that link to "Item:Q1961735"

The following pages link to Bridging gap between standard and differential polynomial approximation: The case of bin-packing (Q1961735):

Displaying 9 items.

• Differential approximation results for the traveling salesman and related problems (Q294874) (← links)
• A survey on the structure of approximation classes (Q458503) (← links)
• Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness (Q557903) (← links)
• Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
• A better differential approximation ratio for symmetric TSP (Q924134) (← links)
• New differential approximation algorithm for \(k\)-customer vehicle routing problem (Q976133) (← links)
• The maximum \(f\)-depth spanning tree problem (Q1603381) (← links)
• The maximum saving partition problem (Q1779697) (← links)
• Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)