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...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 657; pp. 11 - 19
Main Authors: Lin, Mugang, Feng, Qilong, Chen, Jianer, Li, Wenjun
Format: Journal Article
Language:English
Published: Elsevier B.V 02.01.2017
Subjects:
Branching algorithm
Fixed-parameter tractability
Kernelizaton
Network reconfiguration
Branching algorithm
Kernelizaton
Network reconfiguration
Fixed-parameter tractability
ISSN:0304-3975, 1879-2294
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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