Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

3 relations
Approximation algorithmDominating setRandomized algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A Linear Time Algorithm for the $3$-Neighbour Traveling Salesman Problem on Halin graphs and extensions
The Quadratic Travelling Salesman Problem (QTSP) is to find a least cost Hamilton cycle in an edge-weighted graph, where costs… Expand
  • figure 1
  • figure 4
  • figure 5
  • figure 6
  • figure 7
2014
2014
The Bipartite Boolean Quadratic Programming Problem
We consider the Bipartite Boolean Quadratic Programming Problem (BQP01), which generalizes the well-known Boolean Quadratic… Expand
  • figure 1.1
  • figure 1.2
  • figure 2.1
2009
2009
A selection of useful theoretical tools for the design and analysis of optimization heuristics
An intensive practical experimentation is certainly required for the purpose of heuristics design and evaluation, however a… Expand
  • figure 1
2006
2006
Domination analysis for minimum multiprocessor scheduling
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is… Expand
2004
2004
Domination analysis of greedy heuristics for the frequency assignment problem
We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm… Expand
  • figure 1
2003
2003
Domination analysis of combinatorial optimization problems
We use the notion of domination ratio introduced by Glover and Punnen in 1997 to present a new classification of combinatorial… Expand
Highly Cited
2002
Highly Cited
2002
TSP Heuristics: Domination Analysis and Complexity
We show that the 2-Opt and 3-Opt heuristics for the traveling salesman problem (TSP) on the complete graph Kn produce a solution… Expand
  • figure 1
Highly Cited
2002
Highly Cited
2002
Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP
Abstract Computational experiments show that the greedy algorithm (GR) and the nearest neighbor algorithm (NN), popular choices… Expand
2001
2001
TSP tour domination and Hamilton cycle decompositions of regular digraphs
In this paper, we solve a problem by Glover and Punnen (J. Oper. Res. Soc. 48 (1997) 502-510) from the context of domination… Expand
Highly Cited
2001
Highly Cited
2001
Structure and trophic organization of subtidal fish assemblages on the northern Chilean coast: the effect of habitat complexity
A series of local factors such as substrate structure, presence or absence of kelp forests and environmental variables play an… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE