Domination analysis of greedy heuristics for the frequency assignment problem

14Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem. We show that the domination number of this algorithm is at least σn-⌈log2 n⌉-1, where σ is the available span and n the number of vertices in the constraint graph. In contrast to this we show that the standard greedy algorithm has domination number strictly less than σne-5(n-1)/144 for large n and fixed σ. © 2003 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Koller, A. E., & Noble, S. D. (2004). Domination analysis of greedy heuristics for the frequency assignment problem. Discrete Mathematics, 275(1–3), 331–338. https://doi.org/10.1016/j.disc.2003.05.008

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free