Partition on trees with supply and demand: Kernelization and algorithms

Network reconfiguration is an important research topic in the planning and operation of power distribution networks. In this paper, we study the partition problem on trees with supply and demand from parameterized computation perspective. We analyze the relationship between supply nodes and demand n...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Theoretical computer science Ročník 657; s. 11 - 19
Hlavní autori: Lin, Mugang, Feng, Qilong, Chen, Jianer, Li, Wenjun
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 02.01.2017
Predmet:
Branching algorithm
Fixed-parameter tractability
Kernelizaton
Network reconfiguration
Branching algorithm
Kernelizaton
Network reconfiguration
Fixed-parameter tractability
ISSN:0304-3975, 1879-2294
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Network reconfiguration is an important research topic in the planning and operation of power distribution networks. In this paper, we study the partition problem on trees with supply and demand from parameterized computation perspective. We analyze the relationship between supply nodes and demand nodes, and give four reduction rules, which result in a kernel of size O(k2) for the problem. Based on branching technique, a parameterized algorithm of running time O⁎(2.828k) is presented.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2016.06.044