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
Hardness of finding combinatorial shortest paths on graph associahedra - MaRDI portal

Hardness of finding combinatorial shortest paths on graph associahedra

From MaRDI portal

Publication:6638085

Jump to:navigation, search

DOI10.4230/lipics.icalp.2023.82MaRDI QIDQ6638085

Yusuke Kobayashi, Takehiro Ito, Naoyuki Kamiyama, Shun-ichi Maezawa, Yuta Nozaki, Naonori Kakimura, Yoshio Okamoto

Publication date: 14 November 2024

zbMATH Keywords

polymatroids NP-hardness graph associahedra combinatorial shortest path

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

This page was built for publication: Hardness of finding combinatorial shortest paths on graph associahedra

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