On the Parameterized Complexity of the Expected Coverage Problem

The Maximum Covering Location Problem (MCLP) is a well-studied problem in the field of operations research. Given a network with positive or negative demands on the nodes, a positive integer k , the MCLP seeks to find k potential facility centers in the network such that the neighborhood coverage is...

Full description

Saved in:

Bibliographic Details
Published in:	Theory of computing systems Vol. 66; no. 2; pp. 432 - 453
Main Authors:	Fomin, Fedor V., Ramamoorthi, Vijayaragunathan
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2022 Springer Nature B.V
Subjects:	Algorithms Apexes Complexity Computer Science Failure Graph theory Lower bounds Mathematical models Operations research Parameterization Parameters Probability Site selection Theory of Computation Facility location W-hard Negative demands Pathwidth Treewidth
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!