"Approximating the traffic grooming problem in tree and star networks."

Michele Flammini et al. (2008)

> Home

Details and statistics

DOI: 10.1016/J.JPDC.2008.01.003

access: closed

type: Journal Article

metadata version: 2021-07-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jpdc/FlamminiMMSZ08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jpdc/FlamminiMMSZ08
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the traffic grooming problem in tree and star networks. J. Parallel Distributed Comput. 68(7): 939-948 (2008)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.