Swapping labeled tokens on graphs

Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno

研究成果: Conference contribution

16 被引用数 (Scopus)

抄録

Consider a puzzle consisting of n tokens on an n-vertex graph, where each token has a distinct starting vertex and a distinct target vertex it wants to reach, and the only allowed transformation is to swap the tokens on adjacent vertices. We prove that every such puzzle is solvable in O(n2) token swaps, and thus focus on the problem of minimizing the number of token swaps to reach the target token placement. We give a polynomial-time 2-approximation algorithm for trees, and using this, obtain a polynomial-time 2α-approximation algorithm for graphs whose tree α-spanners can be computed in polynomial time. Finally, we show that the problem can be solved exactly in polynomial time on complete bipartite graphs.

本文言語English
ホスト出版物のタイトルFun with Algorithms - 7th International Conference, FUN 2014, Proceedings
出版社Springer Verlag
ページ364-375
ページ数12
ISBN(印刷版)9783319078892
DOI
出版ステータスPublished - 2014
イベント7th International Conference on Fun with Algorithms, FUN 2014 - Sicily, Italy
継続期間: 2014 7 12014 7 3

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
8496 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other7th International Conference on Fun with Algorithms, FUN 2014
国/地域Italy
CitySicily
Period14/7/114/7/3

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Swapping labeled tokens on graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル