PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Asadpour, Arash"

Author of the publication

copydeleteadd this publication to your clipboard
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem.

, , , , and . SODA, page 379-389. SIAM, (2010)

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.

No persons found for author name Asadpour, Arash
add a person with the name Asadpour, Arash
 

Other publications of authors with the same name

On the Inefficiency Ratio of Stable Equilibria in Congestion Games., and . WINE, volume 5929 of Lecture Notes in Computer Science, page 545-552. Springer, (2009)An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods., and . SIAM J. Comput., 39 (7): 2970-2989 (2010)An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem., , , , and . SODA, page 379-389. SIAM, (2010)Stochastic Submodular Maximization., , and . WINE, volume 5385 of Lecture Notes in Computer Science, page 477-489. Springer, (2008)Concise Bid Optimization Strategies with Multiple Budget Constraints., , , and . WINE, volume 8877 of Lecture Notes in Computer Science, page 263-276. Springer, (2014)Concise Bid Optimization Strategies with Multiple Budget Constraints., , , and . Management Science, 65 (12): 5785-5812 (2019)Maximizing Stochastic Monotone Submodular Functions., and . Management Science, 62 (8): 2374-2391 (2016)Santa claus meets hypergraph matchings., , and . ACM Trans. Algorithms, 8 (3): 24:1-24:9 (2012)An approximation algorithm for max-min fair allocation of indivisible goods., and . STOC, page 114-121. ACM, (2007)Online Resource Allocation with Limited Flexibility., , and . Management Science, 66 (2): 642-666 (2020)