Abstract
The talk discusses planning problems where a set of items has to be transported from location A to location B subject to certain collision and/or resource constraints. We analyze the behavior of these problems, discuss their history, and derive some of their combinatorial and algorithmic properties.
Original language | English |
---|---|
Title of host publication | Mathematical Foundations of Computer Science 2012 (37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings) |
Editors | B. Rovan, V. Sassone, P. Widmayer |
Place of Publication | Berlin |
Publisher | Springer |
Pages | 61-62 |
ISBN (Print) | 978-3-642-32588-5 |
DOIs | |
Publication status | Published - 2012 |
Event | 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012) - Bratislava, Slovakia Duration: 27 Aug 2012 → 31 Aug 2012 Conference number: 37 |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Volume | 7464 |
ISSN (Print) | 0302-9743 |
Conference
Conference | 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012) |
---|---|
Abbreviated title | MFCS 2012 |
Country/Territory | Slovakia |
City | Bratislava |
Period | 27/08/12 → 31/08/12 |