Domination analysis of greedy heuristics for the frequency assignment problem
- 1 January 2004
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 275 (1-3) , 331-338
- https://doi.org/10.1016/j.disc.2003.05.008
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination numberDiscrete Applied Mathematics, 2002
- Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSPDiscrete Applied Mathematics, 2002
- Lower Bounds for Fixed Spectrum Frequency AssignmentAnnals of Operations Research, 2001
- Frequency assignment in cellular phone networksAnnals of Operations Research, 1998
- FASoft: A system for discrete channel frequency assignmentRadio Science, 1997
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithmsJournal of the Operational Research Society, 1997
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963