Name
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⊆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⊆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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.disopt.2016.01.003 | Discrete Optimization |
Keywords | Field | DocType |
(Total) vector dominating set,Partial dominating set,Fixed-parameter tractability,Branchwidth,Apex-minor-free graphs | Integer,Graph,Dominating set,Vertex (geometry),Algorithm,Domination analysis,Maximization,Planar graph,Mathematics | Conference |
Volume | ISSN | Citations |
22 | 1572-5286 | 0 |
PageRank | References | Authors |
0.34 | 17 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Toshimasa Ishii | 1 | 110 | 17.03 |
| Hirotaka Ono | 2 | 400 | 56.98 |
| yushi uno | 3 | 222 | 28.80 |