Finding Optimal Solutions to Token Swapping by Conflict-based Search and Reduction to SAT
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F18%3A00324746" target="_blank" >RIV/68407700:21240/18:00324746 - isvavai.cz</a>
Result on the web
<a href="http://ictai2018.org/" target="_blank" >http://ictai2018.org/</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Finding Optimal Solutions to Token Swapping by Conflict-based Search and Reduction to SAT
Original language description
We study practical approaches to solving the token swapping (TSWAP) problem optimally in this paper. In TSWAP, we are given an undirected graph with colored vertices. A colored token is placed in each vertex. A pair of tokens can be swapped between adjacent vertices. The goal is to perform a sequence of swaps so that token and vertex colors agree across the graph. The minimum number of swaps is required in the optimization variant of the problem.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 30th International Conference on Tools with Artificial Intelligence
ISBN
978-1-5386-7449-9
ISSN
1082-3409
e-ISSN
—
Number of pages
8
Pages from-to
592-599
Publisher name
IEEE Computer Society
Place of publication
USA
Event location
Volos
Event date
Nov 5, 2018
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000457750200086