## Abstract

This paper concerns geometric disk problems motivated by base station placement problems arising in wireless network design. We first study problems that involve maximizing the coverage under various interference-avoidance constraints. A representative problem for this type is the maximum weight independent set problem on unit disk graphs, for which we present an exact solution whose complexity is exponential but with a sublinear exponent. Specifically, our algorithm has time complexity 2^{O(}^{√}^{m log m)}, where m is the number of disks. We then study the problem of covering all the clients by a collection of disks of variable radii while minimizing the sum of radii, and present a PTAS for this problem.

Original language | English |
---|---|

Title of host publication | Algorithm Theory - SWAT 2002 - 8th Scandinavian Workshop on Algorithm Theory, Proceedings |

Editors | Martti Penttonen, Erik Meineche Schmidt |

Publisher | Springer Verlag |

Pages | 90-99 |

Number of pages | 10 |

ISBN (Print) | 9783540438663 |

DOIs | |

State | Published - 2002 |

Externally published | Yes |

Event | 8th Scandinavian Workshop on Algorithm Theory, SWAT 2002 - Turku, Finland Duration: 3 Jul 2002 → 5 Jul 2002 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 2368 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 8th Scandinavian Workshop on Algorithm Theory, SWAT 2002 |
---|---|

Country/Territory | Finland |

City | Turku |

Period | 3/07/02 → 5/07/02 |

### Bibliographical note

Publisher Copyright:© Springer-Verlag Berlin Heidelberg 2002.