Covering Problems in the <I>p</I>-Collection Problems

Kaoru WATANABE; Masakazu SENGOKU; Hiroshi TAMURA; Shoji SHINODA

Covering Problems in the p-Collection Problems

Kaoru WATANABE, Masakazu SENGOKU, Hiroshi TAMURA, Shoji SHINODA

Full Text Views

0

Share
Cite this

Summary :

The lower-bounded p-collection problem is the problem where to locate p sinks in a flow network with lower bounds such that the value of a maximum flow is maximum. This paper discusses the cover problems corresponding to the lower bounded p-collection problem. We consider the complexity of the cover problem, and we show polynomial time algorithms for its subproblems in a network with tree structure.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.3 pp.470-475

Publication Date: 1998/03/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section of Selected Papers from the 10th Karuizawa Workshop on Circuits and Systems)

Category

Cite this

Copy

Kaoru WATANABE, Masakazu SENGOKU, Hiroshi TAMURA, Shoji SHINODA, "Covering Problems in the p-Collection Problems" in IEICE TRANSACTIONS on Fundamentals, vol. E81-A, no. 3, pp. 470-475, March 1998, doi: .
Abstract: The lower-bounded p-collection problem is the problem where to locate p sinks in a flow network with lower bounds such that the value of a maximum flow is maximum. This paper discusses the cover problems corresponding to the lower bounded p-collection problem. We consider the complexity of the cover problem, and we show polynomial time algorithms for its subproblems in a network with tree structure.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e81-a_3_470/_p

Copy

@ARTICLE{e81-a_3_470,
author={Kaoru WATANABE, Masakazu SENGOKU, Hiroshi TAMURA, Shoji SHINODA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Covering Problems in the p-Collection Problems},
year={1998},
volume={E81-A},
number={3},
pages={470-475},
abstract={The lower-bounded p-collection problem is the problem where to locate p sinks in a flow network with lower bounds such that the value of a maximum flow is maximum. This paper discusses the cover problems corresponding to the lower bounded p-collection problem. We consider the complexity of the cover problem, and we show polynomial time algorithms for its subproblems in a network with tree structure.},
keywords={},
doi={},
ISSN={},
month={March},}

Copy

TY - JOUR
TI - Covering Problems in the p-Collection Problems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 470
EP - 475
AU - Kaoru WATANABE
AU - Masakazu SENGOKU
AU - Hiroshi TAMURA
AU - Shoji SHINODA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 1998
AB - The lower-bounded p-collection problem is the problem where to locate p sinks in a flow network with lower bounds such that the value of a maximum flow is maximum. This paper discusses the cover problems corresponding to the lower bounded p-collection problem. We consider the complexity of the cover problem, and we show polynomial time algorithms for its subproblems in a network with tree structure.
ER -