"NP-hardness of broadcast scheduling and inapproximability of single-source ..."

Thomas Erlebach, Alexander Hall (2002)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2012-12-07

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/soda/ErlebachH02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/ErlebachH02
Thomas Erlebach, Alexander Hall:
NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. SODA 2002: 194-202

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.