Combinatorial optimization algorithms for radio network planning

Theoretical Computer Science

Volumn 263, Issue 1-2, 2001, Pages 235-245

  Calégari, Patrice ^a   Guidec, Frédéric ^a   Kuonen, Pierre ^a   Nielsen, Frank ^b  

^a EPFL   (Switzerland)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Combinatorial optimization; Genetic algorithm; Parallel computing; Radio transceiver siting; Set system

Indexed keywords

GENETIC ALGORITHMS; OPTIMIZATION; PARALLEL ALGORITHMS; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS; TRANSCEIVERS;

COMBINATORIAL OPTIMIZATION ALGORITHMS; DARWINISM THEORY; RADIO NETWORK PLANNING;

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 0034923421     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00245-0     Document Type: Article

References (17)

1. Almost optimal set covers in finite VC-dimension
2. Parallel island-based genetic algorithm for radio network design
3. A genetic approach to radio network optimization for mobile systems
4. A greedy heuristic for the set-covering problem
5. Approximation of k-set cover by semi-local optimization
6. A threshold of log n for approximating set cover
7. Reducibility among combinatorial problems
8. Almost tight bounds for ε-nets
9. Epsilon-nets and computational geometry
10. An O(|E|√|V|) algorithm for maximum matching in general graphs
11. A survey on approximately optimal solution to some covering and packing problems
12. Improved performance of the greedy algorithm for partial cover
13. A tight analysis of the greedy algorithm for set cover
14. Distributed genetic algorithms