Combinatorial optimization algorithms for radio network planning
- 28 July 2001
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 263 (1-2) , 235-245
- https://doi.org/10.1016/s0304-3975(00)00245-0
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Genetic approach to radio network optimization for mobile systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Parallel Island-Based Genetic Algorithm for Radio Network DesignJournal of Parallel and Distributed Computing, 1997
- Approximation of k-set cover by semi-local optimizationPublished by Association for Computing Machinery (ACM) ,1997
- A threshold of ln n for approximating set cover (preliminary version)Published by Association for Computing Machinery (ACM) ,1996
- Almost optimal set covers in finite VC-dimensionDiscrete & Computational Geometry, 1995
- Epsilon-Nets and Computational GeometryPublished by Springer Nature ,1993
- Almost tight bounds forɛ-NetsDiscrete & Computational Geometry, 1992
- An O(v|v| c |E|) algoithm for finding maximum matching in general graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972