摘要

This paper presents an efficient algorithm for minimizing a certain class of submodular functions that arise in analysis of multiclass queueing systems. In particular, the algorithm can be used for testing whether a given multiclass M/M/1 achieves an expected performance by an appropriate control policy. With the aid of the topological sweeping method for line arrangement, our algorithm runs in O(n(2)) time, where n is the cardinality of the ground set. This is much faster than direct applications of general submodular function minimization algorithms.

  • 出版日期2012

全文