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

minimizing the maximum flow time in the online tsp on the real line

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

Publikováno v: Krumke, S O, Laura, L, Lipmann, M, Marchetti Spaccamela, A, de Paepe, W E, Poensgen, D & Stougie, L 2003, minimizing the maximum flow time in the online tsp on the real line . SPOR Report, no. 2003-01, Technische Universiteit Eindhoven, Eindhoven . < http://repository.tue.nl/623505 >

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2236864e4cbbe1b0fd85dd08efd44d32
https://research.vu.nl/en/publications/3c62b6b2-8fab-44c0-9e6d-4d1bb2e2722c

How to cut a cake almost fairly

Autor: Krumke, S.O., Lipmann, M., de Paepe, W.E., Poensgen, D., Rambau, J., Stougie, L., Woeginger, G.J.

Publikováno v: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'2002), 263-264
STARTPAGE=263;ENDPAGE=264;TITLE=Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'2002)
Proceedings 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02, San Francisco CA, USA, January 6-8, 2002), 263-264
STARTPAGE=263;ENDPAGE=264;TITLE=Proceedings 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02, San Francisco CA, USA, January 6-8, 2002)
Krumke, S O, Lipmann, M, de Paepe, W E, Poensgen, D, Rambau, J, Stougie, L & Woeginger, G J 2002, How to cut a cake almost fairly . in Proceedings 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02, San Francisco CA, USA, January 6-8, 2002) . Society for Industrial and Applied Mathematics, Philadelphia, USA, pp. 263-264, 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 1/01/02 . < http://portal.acm.org/citation.cfm?id=545415 >

In the cake cutting problem, n = 2 players want to cut a cake into n pieces so that every player gets a "fair" share of the cake by his own measure. We describe a protocol with n - 1 cuts in which each player can enforce to get a share of at least 1/

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::146a9cb29b86a967d808d8dd6d2d762e
https://research.utwente.nl/en/publications/2634aa5d-3a21-4276-9bb1-8f4f7c69736a

Non-abusiveness Helps:An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman problem

Autor: Krumke, S.O., Laura, L., Lipmann, M., Marchetti Spaccamela, A., Paepe, de, W.E., Poensgen, D., Stougie, L., Jansen, K., Leonardi, S., Vazirani, V.

Publikováno v: Approximation Algorithms for Combinatorial Optimization (Proceedings APPROX 2002, Rome Italy, September 17-21, 2002), 200-214
STARTPAGE=200;ENDPAGE=214;TITLE=Approximation Algorithms for Combinatorial Optimization (Proceedings APPROX 2002, Rome Italy, September 17-21, 2002)

In the online traveling salesman problem OlTsp requests for visits to cities arrive online while the salesman is traveling. We study the F max-OlTsp where the objective is to minimize the maximum flow time. This objective is particularly interesting

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::499f8610ce515c5e963906d4e669b257
https://research.tue.nl/nl/publications/57ed429e-ff88-4828-bc9e-05298ce050fd

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