Skip to search formSkip to main contentSkip to account menu

Domination analysis

Known as: Dominance number 
Domination analysis of an approximation algorithm is a way to estimate its performance, introduced by Glover and Punnen in 1997. Unlike the classical… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Corn is one of the strategic food commodities in Indonesia which is currently widely used as animal feed ingredient. But the… 
2015
2015
The Quadratic Travelling Salesman Problem (QTSP) is to find a least cost Hamilton cycle in an edge-weighted graph, where costs… 
2009
2009
An intensive practical experimentation is certainly required for the purpose of heuristics design and evaluation, however a… 
Review
2007
Review
2007
In this section, we overview the main results on the topics of this chapter and give basic terminology and notation used… 
Highly Cited
2003
Highly Cited
2003
Highly Cited
2003
Highly Cited
2003
We show that the 2-Opt and 3-Opt heuristics for the traveling salesman problem (TSP) on the complete graph Kn produce a solution… 
2001
Highly Cited
2001
Highly Cited
2001
A series of local factors such as substrate structure, presence or absence of kelp forests and environmental variables play an… 
Review
1986
Review
1986
  • R. K. Wood
  • IEEE Transactions on Reliability
  • 1986
  • Corpus ID: 15675039
Let GK denote a graph G whose edges can fail and with a set K ¿ V specified. Edge failures are independent and have known…