Author of the publication

A Constant Approximation for Maximum Throughput Multicommodity Routing And Its Application to Delay-Tolerant Network Scheduling.

, , , and . INFOCOM, page 46-54. IEEE, (2019)

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

Parametrized complexity of virtual network embeddings: dynamic & linear programming approximations., , and . Comput. Commun. Rev., 49 (1): 3-10 (2019)It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints., , , and . Networking, page 1-3. IEEE, (2021)On the Hardness and Inapproximability of Virtual Network Embeddings., and . IEEE/ACM Trans. Netw., 28 (2): 791-803 (2020)Modeling Adaptive Video Streaming Using Discrete-Time Analysis, , , and . 31th International Teletraffic Congress (ITC 31), Budapest, Hungary, (2019)Charting the Complexity Landscape of Virtual Network Embeddings., and . Networking, page 55-63. IFIP, (2018)Edge replication strategies for wide-area distributed processing., , , and . EdgeSys@EuroSys, page 1-6. ACM, (2020)Virtual network embeddings: Theoretical foundations and provably good algorithms.. Technical University of Berlin, Germany, (2019)A Constant Approximation for Maximum Throughput Multicommodity Routing And Its Application to Delay-Tolerant Network Scheduling., , , and . INFOCOM, page 46-54. IEEE, (2019)Towards Unified Programmability of Cloud and Carrier Infrastructure, , , , , , , , , and 7 other author(s). Third European Workshop on Software Defined Networks, page 6. (2014)Virtual Network Embedding Approximations: Leveraging Randomized Rounding., and . IEEE/ACM Trans. Netw., 27 (5): 2071-2084 (2019)