( en | de | ru )

 

Disambiguation of "Schulz, Andreas S."

Author of the publication

copydeleteadd this publication to your clipboard
Robust Monotone Submodular Function Maximization.

, , and . IPCO, volume 9682 of Lecture Notes in Computer Science, page 312-324. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andreas S Schulz

Andreas S Wirth

Andreas S Lübbe

Andreas S Kolb

Andreas Schulz

 

Other publications of authors with the same name

The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope., and . Math. Oper. Res., 38 (1): 63-91 (2013)Stochastic Online Scheduling Revisited.. COCOA, volume 5165 of Lecture Notes in Computer Science, page 448-457. Springer, (2008)Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands., and . ESA, volume 6942 of Lecture Notes in Computer Science, page 628-639. Springer, (2011)Robust Monotone Submodular Function Maximization., , and . IPCO, volume 9682 of Lecture Notes in Computer Science, page 312-324. Springer, (2016)Single Machine Scheduling with Precedence Constraints: Extended Abstract., and . IPCO, volume 3064 of Lecture Notes in Computer Science, page 283-297. Springer, (2004)Precedence-Constrained Scheduling and Min-Sum Set Cover., and . WAOA, volume 11926 of Lecture Notes in Computer Science, page 170-187. Springer, (2019)A geometric approach to the price of anarchy in nonatomic congestion games., , and . Games Econ. Behav., 64 (2): 457-469 (2008)The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope., and . OR, page 587-592. Springer, (2011)The complexity of welfare maximization in congestion games., and . Networks, 59 (2): 252-260 (2012)Robust Appointment Scheduling., , and . APPROX-RANDOM, volume 28 of LIPIcs, page 356-370. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)