( en | de | ru )

 

Disambiguation of "Shioura, Akiyoshi"

Author of the publication

copydeleteadd this publication to your clipboard
Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach.

, , and . ESA, volume 5193 of Lecture Notes in Computer Science, page 756-767. Springer, (2008)

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.

Jens Oehlschlägel-Akiyoshi

 

Other publications of authors with the same name

Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints., , and . INFORMS J. Comput., 29 (4): 724-736 (2017)Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems., and . SIAM J. Discret. Math., 21 (2): 504-522 (2007)A Fast, Accurate, and Simple Method for Pricing European-Asian and Saving-Asian Options., , , and . Algorithmica, 42 (2): 141-158 (2005)M-Convex Function on Generalized Polymatroid., and . Math. Oper. Res., 24 (1): 95-105 (1999)Time bounds for iterative auctions: A unified approach by discrete convex analysis., , and . Discret. Optim., (2016)Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra.. ISAAC (1), volume 6506 of Lecture Notes in Computer Science, page 169-181. Springer, (2010)Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks., and . SODA, page 944-952. ACM/SIAM, (2000)Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques., , and . Networks, 83 (3): 527-546 (April 2024)Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach., , and . ESA, volume 5193 of Lecture Notes in Computer Science, page 756-767. Springer, (2008)Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions., and . TAMC, volume 6648 of Lecture Notes in Computer Science, page 142-153. Springer, (2011)