A 4.509-approximation algorithm for generalized min-sum set cover that improves the prior 4.642 bound via refined LP analysis and new lower-tail bounds on sums of independent Bernoullis.
An approximation algorithm for the minimum latency set cover problem
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Introduces neighbourhood balancing games on weighted graphs as generalizations of Wardrop and congestion games and studies equilibria existence and efficiency.
citing papers explorer
-
A 4.509-Approximation Algorithm for Generalized Min Sum Set Cover
A 4.509-approximation algorithm for generalized min-sum set cover that improves the prior 4.642 bound via refined LP analysis and new lower-tail bounds on sums of independent Bernoullis.
-
Nonatomic Non-Cooperative Neighbourhood Balancing Games
Introduces neighbourhood balancing games on weighted graphs as generalizations of Wardrop and congestion games and studies equilibria existence and efficiency.