Forming Plurality at Minimum Cost.

Wei-Yin Lin Yen-Wei Wu Hung-Lung Wang Kun-Mao Chao

Published in: WALCOM (2015)

Keyphrases

minimum cost
np hard
approximation algorithms
network flow
network simplex algorithm
network flow problem
spanning tree
capacity constraints
minimum cost flow
computational complexity
undirected graph