5. A “Maximum Node Clustering” Problem

  1. Vangelis Th. Paschos
  1. Giuliana Carello,
  2. Federico Della Croce,
  3. Andrea Grosso and
  4. Marco Locatelli

Published Online: 3 FEB 2010

DOI: 10.1002/9780470611098.ch5

Combinatorial Optimization and Theoretical Computer Science

Combinatorial Optimization and Theoretical Computer Science

How to Cite

Carello, G., Della Croce, F., Grosso, A. and Locatelli, M. (2008) A “Maximum Node Clustering” Problem, in Combinatorial Optimization and Theoretical Computer Science (ed V. Th. Paschos), ISTE, London, UK. doi: 10.1002/9780470611098.ch5

Publication History

  1. Published Online: 3 FEB 2010
  2. Published Print: 1 JAN 2008

ISBN Information

Print ISBN: 9781848210219

Online ISBN: 9780470611098

SEARCH

Keywords:

  • telecommunications network;
  • hierarchical architecture;
  • terminal nodes;
  • traffic demands;
  • traffic matrix

Summary

This chapter contains sections titled:

  • Introduction

  • Approximation algorithm for the general problem

  • The tree case

  • Exponential algorithms for special cases

  • Bibliography