"A Quasi-Polynomial Time Algorithm for Multi-Arrival on Tree-Like Multigraphs."

Ebrahim Ghorbani, Jonah Leander Hoff, Matthias Mnich (2025)

> Home

Details and statistics

DOI: 10.4230/LIPICS.STACS.2025.39

access: closed

type: Conference or Workshop Paper

metadata version: 2025-02-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stacs/GhorbaniHM25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/GhorbaniHM25
Ebrahim Ghorbani, Jonah Leander Hoff, Matthias Mnich:
A Quasi-Polynomial Time Algorithm for Multi-Arrival on Tree-Like Multigraphs. STACS 2025: 39:1-39:19

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.