Výsledky vyhledávání - "Erlebach, T."

Autor: Bonifaci, V., Stougie, L., Erlebach, T., Kaklamanis, C.

Publikováno v: Approximation and Online Algorithms ISBN: 9783540695134
WAOA
Proceedings of the 4th International Workshop on Approximation and Online Algorithms (WAOA 2006) 14-15 September 2006, Zürich, Switzerland, 83-94
STARTPAGE=83;ENDPAGE=94;TITLE=Proceedings of the 4th International Workshop on Approximation and Online Algorithms (WAOA 2006) 14-15 September 2006, Zürich, Switzerland
Theory of Computing Systems, 45(3), 470-485
Scopus-Elsevier
Bonifaci, V & Stougie, L 2009, ' Online k-server routing problems ', Theory of Computing Systems, vol. 45, pp. 470-485 . https://doi.org/10.1007/s00224-008-9103-4
Theory of Computing Systems, 45, 470-485. Springer New York
Theory of Computing Systems, 45(3), 470-485. Springer

In an online k-server routing problem, a crew of k servers has to visit points in a metric space as they arrive in real time. Possible objective functions include minimizing the makespan (k-Traveling Salesman Problem) and minimizing the average compl

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95148cb20583a7fce5b778247b582df7
https://doi.org/10.1007/11970125_7

Zobrazit plný text záznamu

Conference

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Conference

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Off-line admission control for advance reservations in star networks

Autor: Adamy, U., Erlebach, T., Mitsche, D., Schurr, I., Speckmann, B., Welzl, E., Persiano, G., Solis-Oba, R.

Publikováno v: Approximation and Online Algorithms ISBN: 9783540245742
WAOA
Scopus-Elsevier
Approximation and Online Algorithms (2nd International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers), 211-224
STARTPAGE=211;ENDPAGE=224;TITLE=Approximation and Online Algorithms (2nd International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers)

Given a network together with a set of connection requests, call admission control is the problem of deciding which calls to accept and which ones to reject in order to maximize the total profit of the accepted requests. We consider call admission co

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8a9d75608070325413a1f8a544df308c
https://doi.org/10.1007/978-3-540-31833-0_18

Zobrazit plný text záznamu

On minimizing the maximum flow time in the online dial-a-ride problem

Autor: Krumke, S.O., Paepe, de, W.E., Poensgen, D., Lipmann, M., Marchetti Spaccamela, A., Stougie, L., Erlebach, T., Persinao, G.

Publikováno v: Approximation and Online Algorithms (3rd International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised selected papers), 258-269
STARTPAGE=258;ENDPAGE=269;TITLE=Approximation and Online Algorithms (3rd International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised selected papers)
Approximation and Online Algorithms ISBN: 9783540322078
WAOA
Krumke, S O, de Paepe, W E, Poensgen, D, Lipmann, M, Marchetti Spaccamela, A & Stougie, L 2006, On minimizing the maximum flow time in the online dial-a-ride problem . in T Erlebach (ed.), Lecture Notes in Computer Science . pp. 258-269 . < http://dx.doi.org/10.1007/11671411_20 >

In the online dial-a-ride problem (OlDarp), objects must be transported by a server between points in a metric space. Transportation requests (“rides”) arrive online, specifying the objects to be transported and the corresponding source and desti

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c9ece8e2d32cdb58fcb2a7a278d0ff8e
https://hdl.handle.net/1871.1/3bf4a14e-cc54-4bb7-bf82-9e126a92d20d

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání