Improved bounds for scheduling conflicting jobs with minsum criteria (Q4962703): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Guy Kortsarz / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Hadas Shachnai / rank | |||
Normal rank | |||
Revision as of 09:38, 12 February 2024
scientific article; zbMATH DE number 6972861
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved bounds for scheduling conflicting jobs with minsum criteria |
scientific article; zbMATH DE number 6972861 |
Statements
Improved bounds for scheduling conflicting jobs with minsum criteria (English)
0 references
5 November 2018
0 references
approximation algorithms
0 references
LP-rounding
0 references
coloring
0 references
linear programming
0 references
scheduling
0 references
sum multicoloring
0 references
