Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications - DIALM '01

Oblivious gossiping in ad-hoc radio networks

Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications - DIALM '01 ◽

10.1145/381448.381454 ◽

2001 ◽

Cited By ~ 26

Author(s):

Bogdan S. Chlebus ◽

Leszek Gąsieniec ◽

Andrzej Lingas ◽

Aris T. Pagourtzis

Keyword(s):

Ad Hoc ◽

Radio Networks

Download Full-text

A polynomial-time approximation scheme for base station positioning in UMTS networks

Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications - DIALM '01 ◽

10.1145/381448.381455 ◽

2001 ◽

Cited By ~ 34

Author(s):

Matthias Galota ◽

Christian Glaßer ◽

Steffen Reith ◽

Heribert Vollmer

Keyword(s):

Polynomial Time ◽

Approximation Scheme ◽

Base Station ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Umts Networks ◽

Polynomial Time Approximation

Download Full-text

Reactive GRASP with path relinking for channel assignment in mobile phone networks

Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications - DIALM '01 ◽

10.1145/381448.381456 ◽

2001 ◽

Cited By ~ 13

Author(s):

Fernando C. Gomes ◽

Panos Pardalos ◽

Carlos S. Oliveira ◽

Mauricio G. C. Resende

Keyword(s):

Mobile Phone ◽

Channel Assignment ◽

Path Relinking ◽

Mobile Phone Networks

Download Full-text

L(2,1)-labeling of planar graphs

Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications - DIALM '01 ◽

10.1145/381448.381452 ◽

2001 ◽

Cited By ~ 8

Author(s):

Tiziana Calamoneri ◽

Rossella Petreschi

Keyword(s):

Planar Graphs

Download Full-text

On finding optimal registrations in presence of overlapping registration areas

Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications - DIALM '01 ◽

10.1145/381448.381459 ◽

2001 ◽

Cited By ~ 2

Author(s):

Georgios Varsamopoulos ◽

Sandeep K. S. Gupta

Download Full-text

Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges

Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications - DIALM '01 ◽

10.1145/381448.381451 ◽

2001 ◽

Cited By ~ 68

Author(s):

Lali Barriére ◽

Pierre Fraigniaud ◽

Lata Narayanan

Keyword(s):

Ad Hoc Networks ◽

Wireless Ad Hoc Networks ◽

Ad Hoc ◽

Hoc Networks ◽

Unstable Transmission

Download Full-text

Channel access scheduling in Ad Hoc networks with unidirectional links

Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications - DIALM '01 ◽

10.1145/381448.381450 ◽

2001 ◽

Cited By ~ 18

Author(s):

Lichun Bao ◽

J. J. Garcia-Luna-Aceves

Keyword(s):

Ad Hoc Networks ◽

Ad Hoc ◽

Channel Access ◽

Hoc Networks

Download Full-text

A mixed-integer programming model for the cellular telecommunication network design

Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications - DIALM '01 ◽

10.1145/381448.381458 ◽

2001 ◽

Cited By ~ 2

Author(s):

Filipe F. Mazzini ◽

Geraldo R. Mateus

Keyword(s):

Integer Programming ◽

Network Design ◽

Mixed Integer Programming ◽

Programming Model ◽

Telecommunication Network ◽

Mixed Integer ◽

Integer Programming Model ◽

Mixed Integer Programming Model

Download Full-text

Selecting forwarding neighbors in wireless Ad Hoc networks

Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications - DIALM '01 ◽

10.1145/381448.381453 ◽

2001 ◽

Cited By ~ 20

Author(s):

Gruia Călinescu ◽

Ion Măndoiu ◽

Peng-Jun Wan ◽

Alexander Zelikovsky

Keyword(s):

Ad Hoc Networks ◽

Wireless Ad Hoc Networks ◽

Ad Hoc ◽

Hoc Networks

Download Full-text

Discrete models and algorithms for the capacitated location problems arising in UMTS network planning

Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications - DIALM '01 ◽

10.1145/381448.381449 ◽

2001 ◽

Cited By ~ 23

Author(s):

E. Amaldi ◽

A. Capone ◽

F. Malucelli

Keyword(s):

Network Planning ◽

Discrete Models ◽

Location Problems ◽

Capacitated Location ◽

Umts Network Planning

Download Full-text

Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications - DIALM '01
Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Oblivious gossiping in ad-hoc radio networks

A polynomial-time approximation scheme for base station positioning in UMTS networks

Reactive GRASP with path relinking for channel assignment in mobile phone networks

L(2,1)-labeling of planar graphs

On finding optimal registrations in presence of overlapping registration areas

Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges

Channel access scheduling in Ad Hoc networks with unidirectional links

A mixed-integer programming model for the cellular telecommunication network design

Selecting forwarding neighbors in wireless Ad Hoc networks

Discrete models and algorithms for the capacitated location problems arising in UMTS network planning

Export Citation Format

Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications - DIALM '01Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Oblivious gossiping in ad-hoc radio networks

A polynomial-time approximation scheme for base station positioning in UMTS networks

Reactive GRASP with path relinking for channel assignment in mobile phone networks

L(2,1)-labeling of planar graphs

On finding optimal registrations in presence of overlapping registration areas

Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges

Channel access scheduling in Ad Hoc networks with unidirectional links

A mixed-integer programming model for the cellular telecommunication network design

Selecting forwarding neighbors in wireless Ad Hoc networks

Discrete models and algorithms for the capacitated location problems arising in UMTS network planning

Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications - DIALM '01
Latest Publications