Studies on the Space Exploration and the Sink Location under Incomplete Information towards Applications to Evacuation Planning

[1]  D. R. Fulkerson,et al.  Constructing Maximal Dynamic Flows from Static Flows , 1958 .

[2]  Werner Dinkelbach.  On Nonlinear Fractional Programming , 1967 .

[3]  Andy N. C. Kang,et al.  Some Properties of a Centroid of a Free Tree , 1975, Inf. Process. Lett..

[4]  Chul E. Kim,et al.  Approximation algorithms for some routing problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[5]  Xiaotie Deng,et al.  Exploring an unknown graph , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[6]  Bala Kalyanasundaram,et al.  Constructing Competitive Tours from Local Information , 1994, Theor. Comput. Sci..

[7]  Éva Tardos,et al.  “The quickest transshipment problem” , 1995, SODA '95.

[8]  Oded Berman,et al.  (p - 1)/(p + 1)-approximate Algorithms for P-traveling Salesmen Problems on a Tree with Minmax Objective , 1997, Discret. Appl. Math..

[9]  Susanne Albers,et al.  Exploring unknown environments , 1997, STOC '97.

[10]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[11]  Bintong Chen,et al.  Minmax-regret robust 1-median location on a tree , 1998, Networks.

[12]  Andrzej Pelc,et al.  Exploring unknown undirected graphs , 1999, SODA '98.

[13]  Leen Stougie,et al.  Algorithms for the On-Line Travelling Salesman1 , 2001, Algorithmica.

[14]  Oded Berman,et al.  Algorithms for the robust 1-center problem on a tree , 2000, Eur. J. Oper. Res..

[15]  Rolf Klein,et al.  The Polygon Exploration Problem , 2001, SIAM J. Comput..

[16]  V. S. Anil Kumar,et al.  Optimal constrained graph exploration , 2001, SODA '01.

[17]  A. ADoefaa,et al.  ? ? ? ? f ? ? ? ? ? , 2003 .

[18]  Vangelis Th. Paschos,et al.  Algorithms for the On-Line Quota Traveling Salesman Problem , 2004, Inf. Process. Lett..

[19]  Rudolf Fleischer,et al.  Exploring an Unknown Graph Efficiently , 2005, ESA.

[20]  Kazuhisa Makino,et al.  An O(n log2n) algorithm for the optimal sink location problem in dynamic tree networks , 2006, Discret. Appl. Math..

[21]  Christian Schindelhauer,et al.  Power-Aware Collective Tree Exploration , 2006, ARCS.

[22]  D. Kowalski,et al.  Collective tree exploration , 2006 .

[23]  Atsushi Takizawa,et al.  An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity , 2006, IEICE Trans. Inf. Syst..

[24]  Eduardo Conde,et al.  Minmax regret location-allocation problem on a network under uncertainty , 2007, Eur. J. Oper. Res..

[25]  Hiroshi Nagamochi,et al.  Approximating the minmax rooted-tree cover in a tree , 2007, Inf. Process. Lett..

[26]  Christian Schindelhauer,et al.  Why Robots Need Maps , 2007, SIROCCO.

[27]  Eduardo Conde.  A note on the minmax regret centdian location on trees , 2008, Oper. Res. Lett..

[28]  Loukas Georgiadis,et al.  An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree , 2008, Oper. Res. Lett..

[29]  Rudolf Fleischer,et al.  Competitive Online Approximation of the Optimal Search Ratio , 2008, SIAM J. Comput..

[30]  Siegfried Schaible,et al.  Fractional Programming , 2009, Encyclopedia of Optimization.

[31]  Yasuo Okabe,et al.  The Online Graph Exploration Problem on Restricted Graphs , 2009, IEICE Trans. Inf. Syst..

[32]  Andrea Gasparri,et al.  Multirobot Tree and Graph Exploration , 2011, IEEE Transactions on Robotics.

[33]  W. Ogryczak.  Conditional median as a robust solution concept for uncapacitated location problems , 2010 .

[34]  Rolf Klein,et al.  Online algorithms for searching and exploration in the plane , 2010, Comput. Sci. Rev..

[35]  Kurt Mehlhorn,et al.  Online graph exploration: New results on old and new algorithms , 2012, Theor. Comput. Sci..

[36]  Binay K. Bhattacharya,et al.  A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree , 2012, COCOON.

[37]  Euripides Markou,et al.  Online Graph Exploration with Advice , 2012, SIROCCO.

[38]  Yin-Feng Xu,et al.  Minimax Regret 1-Sink Location Problems in Dynamic Path Networks , 2013, TAMC.