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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theory of computing systems Ročník 66; číslo 2; s. 432 - 453
Hlavní autori:	Fomin, Fedor V., Ramamoorthi, Vijayaragunathan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.04.2022 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!