Pages that link to "Item:Q1274917"
From MaRDI portal
The following pages link to Differential approximation algorithms for some combinatorial optimization problems (Q1274917):
Displayed 17 items.
- 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)
- New differential approximation algorithm for \(k\)-customer vehicle routing problem (Q976133) (← links)
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- The maximum \(f\)-depth spanning tree problem (Q1603381) (← 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)
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing (Q1961735) (← links)
- Reductions, completeness and the hardness of approximability (Q2488898) (← links)
- An Improved Approximation Bound for Spanning Star Forest and Color Saving (Q3182915) (← 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)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← 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)