Author of the publication

All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns.

, , , , , , , and . IPCO, volume 7801 of Lecture Notes in Computer Science, page 13-24. Springer, (2013)

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.

 

Other publications of authors with the same name

Improved selection in totally monotone arrays., , , and . Int. J. Comput. Geom. Appl., 3 (2): 115-132 (1993)Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications., , , and . ISTCS, page 78-88. IEEE Computer Society, (1996)Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings., and . PODC, page 282-292. ACM, (1986)The Preemptive Resource Allocation Problem., , and . FSTTCS, volume 150 of LIPIcs, page 26:1-26:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Fast Geometric Approximation Techniques and Geometric Embedding Problems., , , and . Theor. Comput. Sci., 106 (2): 265-281 (1992)Partially Disjoint k Shortest Paths., , , and . CoRR, (2022)Finding the Edge Connectivity of Directed Graphs., and . J. Algorithms, 10 (1): 76-85 (1989)Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality., , , , and . J. Algorithms, 19 (1): 116-143 (1995)Throughput maximization of real-time scheduling with batching., , , , , and . SODA, page 742-751. ACM/SIAM, (2002)Improved Selection on Totally Monotone Arrays., , and . FSTTCS, volume 560 of Lecture Notes in Computer Science, page 347-359. Springer, (1991)