"NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source ..."

Thomas Erlebach, Alexander Hall (2004)

> Home

Details and statistics

DOI: 10.1023/B:JOSH.0000019682.75022.96

access: closed

type: Journal Article

metadata version: 2020-04-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/scheduling/ErlebachH04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scheduling/ErlebachH04
Thomas Erlebach, Alexander Hall:
NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow. J. Sched. 7(3): 223-241 (2004)

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.