{"entities":{"Q5947952":{"pageid":8124754,"ns":120,"title":"Item:Q5947952","lastrevid":25469057,"modified":"2024-03-04T22:45:15Z","type":"item","id":"Q5947952","labels":{"en":{"language":"en","value":"Algorithms - ESA 2001. 9th annual European symposium, \u00c5rhus, Denmark, August 28--31, 2001. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1666879"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5947952$82A5AE9F-29A3-4ED1-A1FC-CD857389E2CE","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"4f54e2ac1949af7eb6ee9a9a3a67ee35a5326e6c","datavalue":{"value":{"text":"Algorithms - ESA 2001. 9th annual European symposium, \u00c5rhus, Denmark, August 28--31, 2001. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5947952$3F202585-7051-4F51-B5D0-180FE72DA9D7","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"50c5ae967e38045e1cead0aef02a332955a6d2fd","datavalue":{"value":"0971.00046","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5947952$264B1A10-EEB1-4799-B8B2-45BB6ADED1CA","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"85c07c7737819bff773f78e2590a3bb761fe677b","datavalue":{"value":{"entity-type":"item","numeric-id":162374,"id":"Q162374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5947952$10A4B1B8-E367-4583-8448-1A9B9D7D2C23","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"db3817d161b0670e4149da15035f59b540781716","datavalue":{"value":{"time":"+2001-10-24T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5947952$00477DE1-509E-4676-8BB2-54C2E8577D9B","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"a1ff82425bc0fb92c27bfe83b02ebd35d0d1cc11","datavalue":{"value":"The articles of mathematical interest will be reviewed individually. The preceding symposium (8th, 2000) has been reviewed (see Zbl 0947.00037).  Indexed articles:  \\textit{Arge, Lars}, External memory data structures. (Invited paper), 1-29 [Zbl 1006.68524]  \\textit{Albers, Susanne}, Some algorithmic problems in large networks, 30-32 [Zbl 1006.68713]  \\textit{Zwick, Uri}, Exact and approximate distances in graphs -- a survey, 33-48 [Zbl 1006.68543]  \\textit{Gaysinsky, Alexander; Itai, Alon; Shachnai, Hadas}, Strongly competitive algorithms for caching with pipelined prefetching, 49-61 [Zbl 1006.68521]  \\textit{Hutchinson, David A.; Sanders, Peter; Vitter, Jeffrey Scott}, Duality between prefetching and queued writing with parallel disks, 62-73 [Zbl 1007.68500]  \\textit{Krumke, Sven O.; de Paepe, Willem E.; Rambau, J\u00f6rg; Stougie, Leen}, Online bin coloring, 74-85 [Zbl 1006.68954]  \\textit{Seiden, Steven S.}, A general decomposition theorem for the \\(k\\)-server problem, 86-97 [Zbl 1006.68956]  \\textit{Csirik, J\u00e1nos; Imreh, Csan\u00e1d; Noga, John; Seiden, Steve S.; Woeginger, Gerhard J.}, Buying a constant competitive ratio for paging, 98-108 [Zbl 1006.68501]  \\textit{Dietzfelbinger, Martin; Hagerup, Torben}, Simple minimal perfect hashing in less space, 109-120 [Zbl 1006.68526]  \\textit{Pagh, Rasmus; Rodler, Flemming Friche}, Cuckoo hashing, 121-133 [Zbl 1006.68522]  \\textit{Sellmann, Meinolf; Fahle, Torsten}, Coupling variable fixing algorithms for the automatic recording problem, 134-145 [Zbl 1159.90479]  \\textit{Lep\u00e8re, Renaud; Trystram, Denis; Woeginger, Gerhard J.}, Approximation algorithms for scheduling malleable tasks under precedence constraints, 146-157 [Zbl 1006.68502]  \\textit{Halld\u00f3rsson, Bjarni V.; Halld\u00f3rsson, Magn\u00fas M.; Ravi, R.}, On the approximability of the minimum test collection problem (extended abstract), 158-169 [Zbl 1006.68958]  \\textit{Kolpakov, Roman; Kucherov, Gregory}, Finding approximate repetitions under Hamming distance, 170-181 [Zbl 1006.68547]  \\textit{Lancia, Giuseppe; Bafna, Vineet; Istrail, Sorin; Lippert, Ross; Schwartz, Russell}, SNPs problems, complexity, and algorithms, 182-193 [Zbl 1016.92023]  \\textit{Angel, Eric; Bampis, Evripidis; Kononov, Alexander}, A FPTAS for approximating the unrelated parallel machines scheduling problem with costs, 194-205 [Zbl 1159.90395]  \\textit{Fishkin, Aleksei V.; Jansen, Klaus; Mastrolilli, Monaldo}, Grouping techniques for scheduling problems: simpler and faster, 206-217 [Zbl 1112.90333]  \\textit{Karuno, Yoshiyuki; Nagamochi, Hiroshi}, A 2-approximation algorithm for the multi-vehicle scheduling problem on a path with release and handling times, 218-229 [Zbl 1159.90405]  \\textit{Goldberg, Andrew V.}, A simple shortest path algorithm with linear average time, 230-241 [Zbl 1007.05088]  \\textit{Mehlhorn, Kurt; Sch\u00e4fer, Guido}, A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms, 242-253 [Zbl 1007.68520]  \\textit{Burnikel, Christoph; Funke, Stefan; Mehlhorn, Kurt; Schirra, Stefan; Schmitt, Susanne}, A separation bound for real algebraic expressions, 254-265 [Zbl 1006.68960]  \\textit{Czumaj, Artur; Sohler, Christian}, Property testing with geometric queries (extended abstract), 266-277 [Zbl 1006.68558]  \\textit{Abellanas, Manuel; Hurtado, Ferran; Icking, Christian; Klein, Rolf; Langetepe, Elmar; Ma, Lihong; Palop, Bel\u00e9n; Sacrist\u00e1n, Vera}, Smallest color-spanning objects, 278-289 [Zbl 1006.68559]  \\textit{Radhakrishnan, Jaikumar; Raman, Venkatesh; Rao, S. Srinivasa}, Explicit deterministic constructions for membership in the bitprobe model, 290-299 [Zbl 1006.68523]  \\textit{Pagh, Rasmus; Rodler, Flemming Friche}, Lossy dictionaries, 300-311 [Zbl 1006.68525]  \\textit{Chazelle, Bernard; Devillers, Olivier; Hurtado, Ferran; Mora, Merc\u00e8; Sacrist\u00e1n, Vera; Teillaud, Monique}, Splitting a Delaunay triangulation in linear time, 312-320 [Zbl 1006.68560]  \\textit{Ebbers-Baumann, Annette; Klein, Rolf; Langetepe, Elmar; Lingas, Andrzej}, A fast algorithm for approximating the detour of a polygonal chain, 321-332 [Zbl 1006.68557]  \\textit{Eidenbenz, Stephan; Widmayer, Peter}, An approximation algorithm for Minimum Convex Cover with logarithmic performance guarantee, 333-344 [Zbl 1007.68190]  \\textit{Czygrinow, A.; Ha\u0144\u0107kowiak, M.; Karo\u0144ski, M.}, Distributed \\(O(\\Delta \\log{n})\\)-edge-coloring algorithm, 345-355 [Zbl 1007.05090]  \\textit{Douceur, John R.; Wattenhofer, Roger P.}, Modeling replica placement in a distributed file system: narrowing the gap between analysis and simulation, 356-367 [Zbl 1006.68955]  \\textit{Bl\u00e4ser, Markus; Siebert, Bodo}, Computing cycle covers without short cycles, 368-379 [Zbl 1007.05089]  \\textit{Thilikos, Dimitrios M.; Serna, Maria J.; Bodlaender, Hans L.}, A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth, 380-390 [Zbl 1007.05091]  \\textit{Sensen, Norbert}, Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows, 391-403 [Zbl 1006.68546]  \\textit{Akcoglu, Karhan; Kao, Ming-Yang; Raghavan, Shuba V.}, Fast pricing of European Asian options with provable accuracy: single-stock and basket options, 404-415 [Zbl 1037.91041]  \\textit{Goldberg, Andrew V.; Hartline, Jason D.}, Competitive auctions for multiple digital goods, 416-427 [Zbl 1037.91036]  \\textit{Langerman, Stefan; Lodha, Sachin; Shah, Rahul}, Algorithms for efficient filtering in content-based multicast, 428-439 [Zbl 1006.68561]  \\textit{Fraigniaud, Pierre}, Approximation algorithms for minimum-time broadcast under the vertex-disjoint paths mode, 440-451 [Zbl 1006.68959]  \\textit{Clementi, Andrea E. F.; Monti, Angelo; Silvestri, Riccardo}, Round robin is optimal for fault-tolerant broadcasting on wireless networks (extended abstract), 452-463 [Zbl 1006.68500]  \\textit{Fiala, Ji\u0159\u00ed; Fishkin, Aleksei V.; Fomin, Fedor V.}, Online and offline distance constrained labeling of disk graphs. (Extended abstract), 464-475 [Zbl 1007.68521]  \\textit{Gavoille, Cyril; Katz, Michal; Katz, Nir A.; Paul, Christophe; Peleg, David}, Approximate distance labeling schemes (extended abstract), 476-487 [Zbl 1006.68542]  \\textit{Dujmovi\u0107, V.; Fellows, M.; Hallett, M.; Kitching, M.; Liotta, G.; McCartin, C.; Nishimura, N.; Ragde, P.; Rosamond, F.; Suderman, M.; Whitesides, S.; Wood, D. R.}, On the parameterized complexity of layered graph drawing, 488-499 [Zbl 1006.68544]  \\textit{Cooper, Colin; Frieze, Alan M.}, A general model of undirected web graphs, 500-511 [Zbl 1006.68541]  \\textit{Caprara, Alberto; Panconesi, Alessandro; Rizzi, Romeo}, Packing cycles and cuts in undirected graphs, 512-523 [Zbl 1006.68545]  \\textit{Zito, Michele}, Greedy algorithms for minimisation problems in random regular graphs, 524-536 [Zbl 1006.68957]","type":"string"},"datatype":"string"},"type":"statement","id":"Q5947952$57223CC3-969B-4CA3-AD24-C407BA40108A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5947952$36C689C5-3BBA-4B52-9774-F6D80C23AEF9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5947952$2A3E0510-6495-4F38-BBB6-120BB643046F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"7a1acd3c7378fd7d1c63a38c32b9eacd632da8cf","datavalue":{"value":"1666879","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5947952$FE5C628A-FC6A-4C21-A4D4-0CD7325FCC79","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"713f4bc846f3e8b0a39d8dc6b198afa80c3de226","datavalue":{"value":"\u00c5rhus (Denmark)","type":"string"},"datatype":"string"},"type":"statement","id":"Q5947952$E7A2ECD4-5010-404C-9D16-3F9C864D52BC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q5947952$AA4D033B-D17F-42C1-A6AA-FD7C4B7BFAD4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1b165f2c80f889e3c73f8a20cfd816794dd15c80","datavalue":{"value":"Symposium","type":"string"},"datatype":"string"},"type":"statement","id":"Q5947952$D99722E3-6686-47E4-9495-B914453E883E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0996155936a7ff3d1530c8b190e9fd79701d2ce4","datavalue":{"value":"ESA 2001","type":"string"},"datatype":"string"},"type":"statement","id":"Q5947952$2C654423-CC83-4B9A-B11F-2E903B082D79","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8baf804bc4c1172cd32c9cc96b06a8c070f11c0c","datavalue":{"value":"Algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q5947952$953FFEEC-868F-4862-B920-B816D5C0C09B","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5947952$95D96E80-5D73-41C6-8903-13CCF88A648E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:5947952","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:5947952"}}}}}