2 citations · 2 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Fast approximation algorithms for the 1-median problem on real-world large graphs
Keisuke Ueta, Wei Wu, Mutsunori Yagiura
The 1-median problem (1MP) on undirected weighted graphs seeks to find a facility location minimizing the total weighted distance to all customer nodes. Although the 1MP can be sol…
cs.DS2017★ 2 cited
Relaxation heuristics for the set multicover problem with generalized upper bound constraints
Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura
We consider an extension of the set covering problem (SCP) introducing (i)~multicover and (ii)~generalized upper bound (GUB)~constraints. For the conventional SCP, the pricing meth…