HUSCAP logo Hokkaido Univ. logo

Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Economics and Business / Faculty of Economics and Business >
Peer-reviewed Journal Articles, etc >

Subexponential fixed-parameter algorithms for partial vector domination

This item is licensed under:Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Files in This Item:
Subexponential fixed-parameter algorithms for partial vector domination.pdf211.18 kBPDFView/Open
Please use this identifier to cite or link to this item:http://hdl.handle.net/2115/71766

Title: Subexponential fixed-parameter algorithms for partial vector domination
Authors: Ishii, Toshimasa Browse this author →KAKEN DB
Ono, Hirotaka Browse this author →KAKEN DB
Uno, Yushi Browse this author →KAKEN DB
Keywords: (Total) vector dominating set
Partial dominating set
Fixed-parameter tractability
Branchwidth
Apex-minor-free graphs
Issue Date: Nov-2016
Publisher: Elsevier
Journal Title: Discrete optimization
Volume: 22
Issue: A
Start Page: 111
End Page: 121
Publisher DOI: 10.1016/j.disopt.2016.01.003
Abstract: Given a graph G = (V, E) of order n and an n-dimensional non-negative vector d = (d(1), d(2), ... , d(n)), called demand vector, the vector domination (resp., total vector domination) is the problem of finding a minimum S subset of V such that every vertex v in V \ S (resp., in V) has at least d(v) neighbors in S. The (total) vector domination is a generalization of many dominating set type problems, e.g., the (total) dominating set problem, the (total) k-dominating set problem (this k is different from the solution size), and so on, and subexponential fixed-parameter algorithms with respect to solution size for apex-minor-free graphs (so for planar graphs) are known. In this paper, we consider maximization versions of the problems; that is, for a given integer k, the goal is to find an S subset of V with size k that maximizes the total sum of satisfied demands. For these problems, we design subexponential fixed-parameter algorithms with respect to k for apex-minor-free graphs. (C) 2016 Elsevier B.V. All rights reserved.
Rights: http://creativecommons.org/licenses/by-nc-nd/4.0/
Relation: ©2016. This manuscript version is made available under the CC-BY-NC-ND 4.0 license
Type: article (author version)
URI: http://hdl.handle.net/2115/71766
Appears in Collections:経済学院・経済学研究院 (Graduate School of Economics and Business / Faculty of Economics and Business) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

Submitter: 石井 利昌

Export metadata:

OAI-PMH ( junii2 , jpcoar_1.0 )

MathJax is now OFF:


 

 - Hokkaido University