Title :
Cover problem corresponding to the p-collection problem
Author :
Watanabe, Kaoru ; Sengoku, Masakaxu ; Tamura, Hiroshi ; Shinoda, Shoji
Author_Institution :
Graduate Sch. of Sci. & Technol., Niigata Univ., Japan
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 :
computational complexity; computer networks; flow graphs; trees (mathematics); complexity; cover problem; flow network; lower-bounded p-collection problem; maximum flow; polynomial time algorithms; subproblems; tree structure; Computer networks; Computer science; Electronic mail; Engineering management; Industrial engineering; Mathematics; Polynomials; Tree data structures;
Conference_Titel :
Circuits and Systems, 1997. ISCAS '97., Proceedings of 1997 IEEE International Symposium on
Print_ISBN :
0-7803-3583-X
DOI :
10.1109/ISCAS.1997.621451
