"New complexity and approximability results for minimizing the total ..."

Péter Györgyi, Tamás Kis (2022)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2022.01.009

access: open

type: Journal Article

metadata version: 2022-05-13

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/GyorgyiK22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/GyorgyiK22
Péter Györgyi, Tamás Kis:
New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints. Discret. Appl. Math. 311: 97-109 (2022)

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.