( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parametrized complexity of virtual network embeddings: dynamic & linear programming approximations.

, , и . Comput. Commun. Rev., 49 (1): 3-10 (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.

Matthias Rost

Matthias Rost

Matthias Rost

Matthias Rost

Matthias Rost

 

Другие публикации лиц с тем же именем

Modeling Adaptive Video Streaming Using Discrete-Time Analysis, , , и . 31th International Teletraffic Congress (ITC 31), Budapest, Hungary, (2019)Improved Bi-criteria Approximation for the All-or-Nothing Multicommodity Flow Problem in Arbitrary Networks., , , , и . CoRR, (2020)On the Hardness and Inapproximability of Virtual Network Embeddings., и . IEEE/ACM Trans. Netw., 28 (2): 791-803 (2020)Charting the Complexity Landscape of Virtual Network Embeddings., и . Networking, стр. 55-63. IFIP, (2018)Improved Throughput for All-or-Nothing Multicommodity Flows With Arbitrary Demands., , , , , , и . IEEE/ACM Trans. Netw., 32 (2): 1435-1450 (апреля 2024)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., , , и . INFOCOM, стр. 46-54. IEEE, (2019)Edge replication strategies for wide-area distributed processing., , , и . EdgeSys@EuroSys, стр. 1-6. ACM, (2020)It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints., , , и . Networking, стр. 1-3. IEEE, (2021)Parametrized complexity of virtual network embeddings: dynamic & linear programming approximations., , и . Comput. Commun. Rev., 49 (1): 3-10 (2019)