Paper by Erik D. Demaine

Reference:

Erik D. Demaine, MohammadTaghi Hajiaghayi, and Dániel Marx, “Minimizing Movement: Fixed-Parameter Tractability”, ACM Transactions on Algorithms, volume 11, number 2, November 2014, Paper 14.

BibTeX

@Article{MovementFPT_TALG,
  AUTHOR        = {Erik D. Demaine and MohammadTaghi Hajiaghayi and
                   D{\'a}niel Marx},
  TITLE         = {Minimizing Movement: Fixed-Parameter Tractability},
  JOURNAL       = {ACM Transactions on Algorithms},
  journalurl    = {http://www.acm.org/talg/},
  VOLUME        = 11,
  NUMBER        = 2,
  MONTH         = {November},
  YEAR          = 2014,
  PAGES         = {Paper 14},

  length        = {27 pages},
  comments      = {The paper is also available as
                   <A HREF="http://arXiv.org/abs/1205.6960">
                   arXiv.org:1205.6960</A> of the
                   <A HREF="http://arXiv.org/archive/cs/intro.html">
                   Computing Research Repository (CoRR)</A>, and from <A HREF="https://doi.org/10.1007/978-3-642-04128-0_64">SpringerLink</A>.},
  papers        = {MovementFPT_ESA2009},
  replaces      = {MovementFPT_ESA2009},
}

Abstract:

We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these problems involve planning the coordinated motion of a collection of agents (representing robots, people, map labels, network messages, etc.) to achieve a global property in the network while minimizing the maximum or average movement (expended energy). The only previous theoretical results about this class of problems are about approximation, and mainly negative: many movement problems of interest have polynomial inapproximability. Given that the number of mobile agents is typically much smaller than the complexity of the environment, we turn to fixed-parameter tractability. We characterize the boundary between tractable and intractable movement problems in a very general setup: it turns out the complexity of the problem fundamentally depends on the treewidth of the minimal configurations. Thus the complexity of a particular problem can be determined by answering a purely combinatorial question. Using our general tools, we determine the complexity of several concrete problems and fortunately show that many movement problems of interest can be solved efficiently.

Comments:

The paper is also available as arXiv.org:1205.6960 of the Computing Research Repository (CoRR), and from SpringerLink.

Length:

The paper is 27 pages.

Availability:

The paper is available in PostScript (927k), gzipped PostScript (415k), and PDF (506k).

See information on file formats.

[Google Scholar search]

Related papers:

MovementFPT_ESA2009 (Minimizing Movement: Fixed-Parameter Tractability)