Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316): Difference between revisions

Latest revision as of 01:48, 26 July 2024

scientific article; zbMATH DE number 6784067

Lift-and-round to improve weighted completion time on unrelated machines

Language	Label	Description	Also known as
English	Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines	scientific article; zbMATH DE number 6784067	Lift-and-round to improve weighted completion time on unrelated machines

Statements

instance of

scholarly article

0 references

title

Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (English)

0 references

Lift-and-round to improve weighted completion time on unrelated machines (English)

0 references

0 references

0 references

0 references

SIAM Journal on Computing

0 references

Proceedings of the forty-eighth annual ACM symposium on Theory of Computing

0 references

publication date

29 June 2021

0 references

29 September 2017

0 references

full work available at URL

https://arxiv.org/abs/1511.07826

0 references

zbMATH Keywords

approximation algorithms

0 references

SDP

0 references

rounding theorems

0 references

scheduling

0 references

semidefinite programming

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q4263699

0 references

A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

0 references

Santa claus meets hypergraph matchings

0 references

Q3549603

0 references

Convex programming for scheduling unrelated parallel machines

0 references

The Santa Claus problem

0 references

On Allocating Goods to Maximize Fairness

0 references

Q4535067

0 references

Approximation Techniques for Average Completion Time Scheduling

0 references

Q5365101

0 references

A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines

0 references

Q3579476

0 references

Dependent rounding and its applications to approximation algorithms

0 references

Single Machine Scheduling with Release Dates

0 references

Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms

0 references

Q4875178

0 references

Q3840371

0 references

On the stochastic independence properties of hard-core distributions

0 references

A unified approach to scheduling on unrelated parallel machines

0 references

Approximation algorithms for scheduling unrelated parallel machines

0 references

Solving Optimization Problems with Diseconomies of Scale via Decoupling

0 references

Task Scheduling in Networks

0 references

Minimizing average completion time in the presence of release dates

0 references

Polynomial time approximation algorithms for machine scheduling: Ten open problems

0 references

Q4252432

0 references

Convex quadratic and semidefinite programming relaxations in scheduling

0 references

A PTAS for minimizing the weighted sum of job completion times on parallel machines

0 references

Santa Claus Schedules Jobs on Unrelated Machines

0 references

Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines

0 references

Identifiers

zbMATH Open document ID

0 references

0 references

0 references

10.1145/2897518.2897572

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4997316

@@ Property / cites work @@
+Q4263699
@@ Property / cites work: Q4263699 / rank @@
+Normal rank
@@ Property / cites work @@
+A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
+Normal rank
@@ Property / cites work @@
+Santa claus meets hypergraph matchings
@@ Property / cites work: Santa claus meets hypergraph matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549603
@@ Property / cites work: Q3549603 / rank @@
+Normal rank
@@ Property / cites work @@
+Convex programming for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+The Santa Claus problem
@@ Property / cites work: The Santa Claus problem / rank @@
+Normal rank
@@ Property / cites work @@
+On Allocating Goods to Maximize Fairness
@@ Property / cites work: On Allocating Goods to Maximize Fairness / rank @@
+Normal rank
@@ Property / cites work @@
+Q4535067
@@ Property / cites work: Q4535067 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Techniques for Average Completion Time Scheduling
+Normal rank
@@ Property / cites work @@
+Q5365101
@@ Property / cites work: Q5365101 / rank @@
+Normal rank
@@ Property / cites work @@
+A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Q3579476
@@ Property / cites work: Q3579476 / rank @@
+Normal rank
@@ Property / cites work @@
+Dependent rounding and its applications to approximation algorithms
+Normal rank
@@ Property / cites work @@
+Single Machine Scheduling with Release Dates
@@ Property / cites work: Single Machine Scheduling with Release Dates / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
+Normal rank
@@ Property / cites work @@
+Q4875178
@@ Property / cites work: Q4875178 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3840371
@@ Property / cites work: Q3840371 / rank @@
+Normal rank
@@ Property / cites work @@
+On the stochastic independence properties of hard-core distributions
+Normal rank
@@ Property / cites work @@
+A unified approach to scheduling on unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Solving Optimization Problems with Diseconomies of Scale via Decoupling
+Normal rank
@@ Property / cites work @@
+Task Scheduling in Networks
@@ Property / cites work: Task Scheduling in Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing average completion time in the presence of release dates
+Normal rank
@@ Property / cites work @@
+Scheduling Unrelated Machines by Randomized Rounding
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation algorithms for machine scheduling: Ten open problems
+Normal rank
@@ Property / cites work @@
+Q4252432
@@ Property / cites work: Q4252432 / rank @@
+Normal rank
@@ Property / cites work @@
+Convex quadratic and semidefinite programming relaxations in scheduling
+Normal rank
@@ Property / cites work @@
+A PTAS for minimizing the weighted sum of job completion times on parallel machines
+Normal rank
@@ Property / cites work @@
+Santa Claus Schedules Jobs on Unrelated Machines
@@ Property / cites work: Santa Claus Schedules Jobs on Unrelated Machines / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
+Normal rank