Go to the corresponding LIPIcs Volume Portal 
Ito, Takehiro ; Kakimura, Naonori ; Kamiyama, Naoyuki ; Kobayashi, Yusuke ; Maezawa, Shunichi ; Nozaki, Yuta ; Okamoto, Yoshio
pdfformat: 

@InProceedings{ito_et_al:LIPIcs.ICALP.2023.82, author = {Ito, Takehiro and Kakimura, Naonori and Kamiyama, Naoyuki and Kobayashi, Yusuke and Maezawa, Shunichi and Nozaki, Yuta and Okamoto, Yoshio}, title = {{Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {82:182:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772785}, ISSN = {18688969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18134}, URN = {urn:nbn:de:0030drops181344}, doi = {10.4230/LIPIcs.ICALP.2023.82}, annote = {Keywords: Graph associahedra, combinatorial shortest path, NPhardness, polymatroids} }
Keywords:  Graph associahedra, combinatorial shortest path, NPhardness, polymatroids  
Collection:  50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)  
Issue Date:  2023  
Date of publication:  05.07.2023 