Cover problem corresponding to the p-collection problem

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

Full description

Saved in:
Bibliographic Details
Published in1997 IEEE International Symposium on Circuits and Systems Vol. 3; pp. 1656 - 1659 vol.3
Main Authors Watanabe, K., Sengoku, M., Tamura, H., Shinoda, S.
Format Conference Proceeding
LanguageEnglish
Japanese
Published IEEE 22.11.2002
Subjects
Computer networks
Computer science
Electronic mail
Engineering management
Industrial engineering
Mathematics
Polynomials
Tree data structures
Online AccessGet full text
ISBN9780780335837
078033583X
DOI10.1109/ISCAS.1997.621451

Cover

More Information
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.
ISBN:9780780335837
078033583X
DOI:10.1109/ISCAS.1997.621451