| Paper Abstract and Keywords |
| Presentation |
2011-10-21 10:00
Memory-Constrained Algorithms for Shortest Path Problem Tetsuo Asano (JAIST), Benjamin Doerr (MPI) COMP2011-28 |
| Abstract |
(in Japanese) |
(See Japanese page) |
| (in English) |
This paper presents a space-efficient algorithm for finding a shortest
path in a grid graph whose size is $\sqrt{n}\times \sqrt{n}$ and
edge weights can be any positive numbers.
Our algorithm finds a shortest path between two arbitrarily specified
vertices in such a graph using only $o(n)$ work space.
More exactly, it runs in polynomial time in $n$ using work space of
$O(n^{1+\varepsilon})$ for any positive real value $\varepsilon$.
This is the first sublinear-space algorithm for the problem. |
| Keyword |
(in Japanese) |
(See Japanese page) |
| (in English) |
Shortest path / Dijkstra's algorithm / Memory-Constrained algorithm / / / / / |
| Reference Info. |
IEICE Tech. Rep., vol. 111, no. 256, COMP2011-28, pp. 1-5, Oct. 2011. |
| Paper # |
COMP2011-28 |
| Date of Issue |
2011-10-14 (COMP) |
| ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
| Download PDF |
COMP2011-28 |
| Conference Information |
| Committee |
COMP |
| Conference Date |
2011-10-21 - 2011-10-21 |
| Place (in Japanese) |
(See Japanese page) |
| Place (in English) |
Tohoku Univ. |
| Topics (in Japanese) |
(See Japanese page) |
| Topics (in English) |
|
| Paper Information |
| Registration To |
COMP |
| Conference Code |
2011-10-COMP |
| Language |
English |
| Title (in Japanese) |
(See Japanese page) |
| Sub Title (in Japanese) |
(See Japanese page) |
| Title (in English) |
Memory-Constrained Algorithms for Shortest Path Problem |
| Sub Title (in English) |
|
| Keyword(1) |
Shortest path |
| Keyword(2) |
Dijkstra's algorithm |
| Keyword(3) |
Memory-Constrained algorithm |
| Keyword(4) |
|
| Keyword(5) |
|
| Keyword(6) |
|
| Keyword(7) |
|
| Keyword(8) |
|
| 1st Author's Name |
Tetsuo Asano |
| 1st Author's Affiliation |
JAIST (JAIST) |
| 2nd Author's Name |
Benjamin Doerr |
| 2nd Author's Affiliation |
Benjamin Doerr (MPI) |
| 3rd Author's Name |
|
| 3rd Author's Affiliation |
() |
| 4th Author's Name |
|
| 4th Author's Affiliation |
() |
| 5th Author's Name |
|
| 5th Author's Affiliation |
() |
| 6th Author's Name |
|
| 6th Author's Affiliation |
() |
| 7th Author's Name |
|
| 7th Author's Affiliation |
() |
| 8th Author's Name |
|
| 8th Author's Affiliation |
() |
| 9th Author's Name |
|
| 9th Author's Affiliation |
() |
| 10th Author's Name |
|
| 10th Author's Affiliation |
() |
| 11th Author's Name |
|
| 11th Author's Affiliation |
() |
| 12th Author's Name |
|
| 12th Author's Affiliation |
() |
| 13th Author's Name |
|
| 13th Author's Affiliation |
() |
| 14th Author's Name |
|
| 14th Author's Affiliation |
() |
| 15th Author's Name |
|
| 15th Author's Affiliation |
() |
| 16th Author's Name |
|
| 16th Author's Affiliation |
() |
| 17th Author's Name |
|
| 17th Author's Affiliation |
() |
| 18th Author's Name |
|
| 18th Author's Affiliation |
() |
| 19th Author's Name |
|
| 19th Author's Affiliation |
() |
| 20th Author's Name |
|
| 20th Author's Affiliation |
() |
| 21st Author's Name |
|
| 21st Author's Affiliation |
() |
| 22nd Author's Name |
|
| 22nd Author's Affiliation |
() |
| 23rd Author's Name |
|
| 23rd Author's Affiliation |
() |
| 24th Author's Name |
|
| 24th Author's Affiliation |
() |
| 25th Author's Name |
|
| 25th Author's Affiliation |
() |
| 26th Author's Name |
/ / |
| 26th Author's Affiliation |
()
() |
| 27th Author's Name |
/ / |
| 27th Author's Affiliation |
()
() |
| 28th Author's Name |
/ / |
| 28th Author's Affiliation |
()
() |
| 29th Author's Name |
/ / |
| 29th Author's Affiliation |
()
() |
| 30th Author's Name |
/ / |
| 30th Author's Affiliation |
()
() |
| 31st Author's Name |
/ / |
| 31st Author's Affiliation |
()
() |
| 32nd Author's Name |
/ / |
| 32nd Author's Affiliation |
()
() |
| 33rd Author's Name |
/ / |
| 33rd Author's Affiliation |
()
() |
| 34th Author's Name |
/ / |
| 34th Author's Affiliation |
()
() |
| 35th Author's Name |
/ / |
| 35th Author's Affiliation |
()
() |
| 36th Author's Name |
/ / |
| 36th Author's Affiliation |
()
() |
| Speaker |
Author-1 |
| Date Time |
2011-10-21 10:00:00 |
| Presentation Time |
35 minutes |
| Registration for |
COMP |
| Paper # |
COMP2011-28 |
| Volume (vol) |
vol.111 |
| Number (no) |
no.256 |
| Page |
pp.1-5 |
| #Pages |
5 |
| Date of Issue |
2011-10-14 (COMP) |