Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Lower Bounds for Approximating Graph Parameters via Communication Complexity - MaRDI portal

Lower Bounds for Approximating Graph Parameters via Communication Complexity

From MaRDI portal

Publication:6291236

Jump to:navigation, search

DOI10.4230/LIPICS.APPROX-RANDOM.2018.11zbMath1521.68096arXiv1709.04262MaRDI QIDQ6291236

Will Rosenbaum, Talya Eden

Publication date: 13 September 2017

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20) Communication complexity, information complexity (68Q11)

This page was built for publication: Lower Bounds for Approximating Graph Parameters via Communication Complexity

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6291236&oldid=35859411"