Fully Dynamic Evaluation of Sequence Pair

In the electronic design automation field, as well as in other areas, problem instances and solutions are often subject to discrete changes. The foundational significance of efficient updates of the criterion value after dynamic updates, instead of recomputing it from scratch each time, has attracte...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on computer-aided design of integrated circuits and systems Ročník 32; číslo 6; s. 894 - 904
Hlavný autor: Kozik, A.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: IEEE 01.06.2013
Predmet:
Algorithm design and analysis
Data structures
Evaluation algorithm
fully dynamic algorithm
Heuristic algorithms
History
sequence pair
Time complexity
Vegetation
ISSN:0278-0070, 1937-4151
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In the electronic design automation field, as well as in other areas, problem instances and solutions are often subject to discrete changes. The foundational significance of efficient updates of the criterion value after dynamic updates, instead of recomputing it from scratch each time, has attracted a lot of research. In this paper, motivated by the significance of the sequence pair (SP) representation for floorplanning, we develop a fully dynamic algorithm of SP evaluation, that efficiently updates a criterion value after insertions and deletions of SP elements and after modifications of element weights. Our result is based on a new data structure for the predecessor problem, which maintains the whole history of its dynamic modifications, and the path-compression technique from the union-find problem, which efficiently support predecessor queries. Numerical experiments showed that our algorithm exhibits linear-time behavior and considerably reduces the time of SP evaluation, compared to other approaches.
ISSN:0278-0070
1937-4151
DOI:10.1109/TCAD.2013.2244642