@inproceedings{krauthgamer:LIPIcs:2020:12409,
Address = {Dagstuhl, Germany},
Annote = {Keywords: Sketching, edge sparsification, vertex sparsification, Gomory-Hu tree, mimicking networks, graph sampling, succinct data structures},
Author = {Krauthgamer, Robert},
BookTitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
Editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
File = {Sketching Graphs and Combinatorial Optimization - LIPIcs-ICALP-2020-2 - a - j.pdf},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
Pages = {2:1--2:1},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{Sketching Graphs and Combinatorial Optimization (Invited Talk)}},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12409},
Volume = {168},
Year = {2020},
bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2020/12409},
bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.ICALP.2020.2},
date-added = {2020-07-08 07:58:04 +0200},
date-modified = {2020-07-08 07:58:04 +0200},
urn = {urn:nbn:de:0030-drops-124090},
doi = {10.4230/LIPIcs.ICALP.2020.2}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A