A constant-factor approximation for generalized malleable scheduling under M^ -concave processing speeds
From MaRDI portal
Publication:6589760
DOI10.1007/S10107-023-02054-ZMaRDI QIDQ6589760FDOQ6589760
Jannik Matuschke, Dimitris Fotakis, Orestis Papadigenopoulos
Publication date: 20 August 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Cites Work
- Discrete Convex Analysis
- Walrasian equilibrium with gross substitutes
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Job Matching, Coalition Formation, and Gross Substitutes
- Approximation algorithms for scheduling unrelated parallel machines
- The Santa Claus problem
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- Approximation Algorithms for Scheduling Parallel Jobs
- \(M\)-convex function on generalized polymatroid
- A Note on Kelso and Crawford's Gross Substitutes Condition
- Complexity of Scheduling Parallel Task Systems
- Strong LP formulations for scheduling splittable jobs on unrelated machines
- Computing Walrasian equilibria: fast algorithms and structural properties
- Gross substitutability: an algorithmic survey
- Scheduling cleaning activities on trains by minimizing idle times
- Approximating Nash social welfare under rado valuations
- Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints
This page was built for publication: A constant-factor approximation for generalized malleable scheduling under \(M^{\natural }\)-concave processing speeds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589760)
