Birx, Alexander ; Disser, Yann ; Hopp, Alexander V. ; Karousatou, Christina (2020)
Improved Lower Bound for Competitive Graph Exploration.
doi: 10.48550/arXiv.2002.10958
Report, Bibliographie
URL / URN: https://arxiv.org/abs/2002.10958
| Item Type: | Report |
|---|---|
| Erschienen: | 2020 |
| Creators: | Birx, Alexander ; Disser, Yann ; Hopp, Alexander V. ; Karousatou, Christina |
| Type of entry: | Bibliographie |
| Title: | Improved Lower Bound for Competitive Graph Exploration |
| Language: | English |
| Date: | 25 February 2020 |
| Publisher: | arXiv |
| Series: | Data Structures and Algorithms |
| Edition: | 1.Version |
| DOI: | 10.48550/arXiv.2002.10958 |
| URL / URN: | https://arxiv.org/abs/2002.10958 |
| Divisions: | Exzellenzinitiative Exzellenzinitiative > Graduate Schools Exzellenzinitiative > Graduate Schools > Graduate School of Computational Engineering (CE) 04 Department of Mathematics 04 Department of Mathematics > Optimization |
| Date Deposited: | 26 Oct 2020 11:33 |
| Last Modified: | 10 Aug 2023 13:55 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Send an inquiry |
Options (only for editors)
 |
Show editorial Details |
Drucken
Impressum