A truthful constant approximation for maximizing the minimum load on related machines (Q388122): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2013.04.003
@@ Property / DOI: 10.1016/j.tcs.2013.04.003 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6239365
@@ Property / zbMATH DE Number: 6239365 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+algorithmic mechanism design
@@ Property / zbMATH Keywords: algorithmic mechanism design / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+scheduling
@@ Property / zbMATH Keywords: scheduling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+machine covering
@@ Property / zbMATH Keywords: machine covering / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithms
@@ Property / zbMATH Keywords: approximation algorithms / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2013.04.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2000865829
@@ Property / OpenAlex ID: W2000865829 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549603
@@ Property / cites work: Q3549603 / rank @@
+Normal rank
@@ Property / cites work @@
+On Two Dimensional Packing
@@ Property / cites work: On Two Dimensional Packing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4400843
@@ Property / cites work: Q4400843 / rank @@
+Normal rank
@@ Property / cites work @@
+The Santa Claus problem
@@ Property / cites work: The Santa Claus problem / rank @@
+Normal rank
@@ Property / cites work @@
+MaxMin allocation via degree lower-bounded arborescences
+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 @@
+Q5417684
@@ Property / cites work: Q5417684 / rank @@
+Normal rank
@@ Property / cites work @@
+Truthful Approximation Schemes for Single-Parameter Agents
+Normal rank
@@ Property / cites work @@
+Approximation schemes for scheduling and covering on unrelated machines
+Normal rank
@@ Property / cites work @@
+Approximation schemes for scheduling on uniformly related and identical parallel machines
+Normal rank
@@ Property / cites work @@
+Maximizing the minimum load for selfish agents
@@ Property / cites work: Maximizing the minimum load for selfish agents / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579476
@@ Property / cites work: Q3579476 / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
+Normal rank
@@ Property / cites work @@
+Q2934709
@@ Property / cites work: Q2934709 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Auction Design
@@ Property / cites work: Optimal Auction Design / rank @@
+Normal rank
@@ Property / cites work @@
+A Robust PTAS for Machine Covering and Packing
@@ Property / cites work: A Robust PTAS for Machine Covering and Packing / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation scheme for maximizing the minimum machine completion time
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2013.04.003
@@ Property / DOI: 10.1016/J.TCS.2013.04.003 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:388122