×

zbMATH — the first resource for mathematics

Theory and practice of algorithms in (computer) systems. First international ICST conference, TAPAS 2011, Rome, Italy, April 18–20, 2011. Proceedings. (English) Zbl 1213.68050
Lecture Notes in Computer Science 6595. Berlin: Springer (ISBN 978-3-642-19753-6/pbk). x, 265 p. (2011).

Show indexed articles as search result.

The articles of this volume will be reviewed individually.
Indexed articles:
Atkins, Leon; Aupy, Guillaume; Cole, Daniel; Pruhs, Kirk, Speed scaling to manage temperature, 9-20 [Zbl 1325.68036]
Bader, Roland; Dees, Jonathan; Geisberger, Robert; Sanders, Peter, Alternative route graphs in road networks, 21-32 [Zbl 1325.68217]
Bessas, Apostolos; Kontogiannis, Spyros; Zaroliagis, Christos, Robust line planning in case of multiple pools and disruptions, 33-44 [Zbl 1325.90023]
Bodlaender, Hans L.; van Rooij, Johan M. M., Exact algorithms for intervalizing colored graphs, 45-56 [Zbl 1325.05160]
Calamoneri, Tiziana; Petreschi, Rossella, \(L(2,1)\)-labeling of unigraphs (extended abstract), 57-68 [Zbl 1325.05162]
Chan, Ho-Leung; Lam, Tak-Wah; Li, Rongbin, Energy-efficient due date scheduling, 69-80 [Zbl 1325.90037]
de Berg, Mark; Cook, Atlas F. IV, Go with the flow: the direction-based Fréchet distance of polygonal curves, 81-91 [Zbl 1325.68250]
Crescenzi, Pierluigi; Grossi, Roberto; Lanzi, Leonardo; Marino, Andrea, A comparison of three algorithms for approximating the distance distribution in real-world graphs, 92-103 [Zbl 1325.05164]
Dorn, Britta; Hüffner, Falk; Krüger, Dominikus; Niedermeier, Rolf; Uhlmann, Johannes, Exploiting bounded signal flow for graph orientation based on cause-effect pairs, 104-115 [Zbl 1325.05165]
Faigle, Ulrich; Kern, Walter; Peis, Britta, On greedy and submodular matrices, 116-126 [Zbl 1325.90062]
Frasch, Janick V.; Krumke, Sven Oliver; Westphal, Stephan, MIP formulations for flowshop scheduling with limited buffers, 127-138 [Zbl 1325.90040]
Goerigk, Marc; Schöbel, Anita, A scenario-based approach for robust linear optimization, 139-150 [Zbl 1325.90063]
Junttila, Tommi; Kaski, Petteri, Conflict propagation and component recursion for canonical labeling, 151-162 [Zbl 1325.05169]
Kanj, Iyad A.; Zhang, Fenghui, 3-hitting set on bounded degree hypergraphs: upper and lower bounds on the kernel size, 163-174 [Zbl 1325.68109]
Kern, Walter; Qiu, Xian, Improved taxation rate for bin packing games, 175-180 [Zbl 1325.91012]
Kowalski, Dariusz R.; Rokicki, Mariusz A., Multi-channel assignment for communication in radio networks, 181-192 [Zbl 1325.90020]
Laura, Luigi; Santaroni, Federico, Computing strongly connected components in the streaming model, 193-205 [Zbl 1325.05171]
Lucarelli, Giorgio; Milis, Ioannis, Improved approximation algorithms for the max-edge coloring problem, 206-216 [Zbl 1325.68257]
Meyer, Ulrich; Negoescu, Andrei; Weichert, Volker, New bounds for old algorithms: on the average-case behavior of classic single-source shortest-paths approaches, 217-228 [Zbl 1325.68111]
Berthold, Timo; Heinz, Stefan; Schulz, Jens, An approximative criterion for the potential of energetic reasoning, 229-239 [Zbl 1325.90035]
Sun, Hongyang; He, Yuxiong; Hsu, Wen-Jing, Speed scaling for energy and performance with instantaneous parallelism, 240-251 [Zbl 1325.68039]
Tonoyan, Tigran, Algorithms for scheduling with power control in wireless networks, 252-263 [Zbl 1325.90050]
MSC:
68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68Wxx Algorithms in computer science
00B25 Proceedings of conferences of miscellaneous specific interest
PDF BibTeX XML Cite
Full Text: DOI