An inverse model for the most uniform problem

Authors:
Qin Wang;Jinjiang Yuan;Jianzhong Zhang
Affiliations:
Department of Mathematics, China Jiliang University, Hangzhou, China;Department of Mathematics, Zhengzhou University, Zhengzhou, China;Department of System Engineering and Engineering Management, Chinese University of Hong Kong, Hong Kong
Venue:
Operations Research Letters
Year:
2008

Citing 6
Cited 0

Slowing down sorting networks to obtain faster sorting algorithms

Journal of the ACM (JACM)
Most and least uniform spanning trees

Discrete Applied Mathematics
On finding most uniform spanning trees

Discrete Applied Mathematics
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
A Class of Inverse Dominant Problems under Weighted l∞ Norm and an Improved Complexity Bound for Radzik's Algorithm

Journal of Global Optimization
Balanced optimization problems

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider a kind of inverse model for the most uniform problem. This model has some practical background. It is shown that the model can be solved in polynomial time whenever an associated min-sum problem can be solved in polynomial time.