A capacity scaling algorithm for M-convex submodular flow

A capacity scaling algorithm for M-convex submodular flow
Автор
 
Год
 
Страниц
 
22

Описание:

This paper presents a faster algorithm for the M-convex submodular How problem, which is a generalization of the minimum-cost How problem with an M-convex cost function for the How-boundary, where an M-convex function is a nonlinear nonseparable cliserete convex function on integer points. The algorithm extends the capacity sealing approach lor the submodular How problem by Fleischer. Iwata and MeCormiek (2002) with the aid of a novel technique of changing the potential by solving maximum submodular How problems.

Похожие книги

Critical Thinking in the L2 Literature Classroom in Thai UniversitiesCritical Thinking in the L2 Literature Classroom in Thai Universities
Автор: Sukanya Kaowiwattanakul
Год: 2010
ASIC Design for a Coherent Optical Receiver DSPU. Design issues related to high-speed MOS ASIC for a coherent optical QPSK with polarization multiplex receiver DSPUASIC Design for a Coherent Optical Receiver DSPU. Design issues related to high-speed MOS ASIC for a coherent optical QPSK with polarization multiplex receiver DSPU
Год: 2011
Baseball Parks by CapacityBaseball Parks by Capacity
Год: 2011
Dynamic Priority Allocation in Restless Bandit Models. Designing simple and well-performing rules for dynamic and stochastic resource allocation problemsDynamic Priority Allocation in Restless Bandit Models. Designing simple and well-performing rules for dynamic and stochastic resource allocation problems
Год: 2011
Design and Performance of 3G Wireless Networks and Wireless LANsDesign and Performance of 3G Wireless Networks and Wireless LANs
Автор: Mooi Choo Chuah
Год: 2005
Capacity FactorCapacity Factor
Год: 2011