Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

DAM
1998

favoriteEmaildiscussreport

65views more DAM 1998»

Minimization of an M-convex Function

13 years 4 months ago

Minimization of an M-convex Function

Download www.dais.is.tohoku.ac.jp

M-convex functions, introduced by Murota (1996, 1998), enjoy various desirable properties as “discrete convex functions.” In this paper, we propose two new polynomial-time scaling algorithms for the minimization of an M-convex function. Both algorithms apply a scaling technique to a greedy algorithm for M-convex function minimization, and run as fast as the previous minimization algorithms. We also specialize our scaling algorithms for the resource allocation problem which is a special case of M-convex function minimization.

Akiyoshi Shioura

Real-time Traffic

Algorithms | DAM 1998 | M-convex Function | Polynomial-time Scaling Algorithms |

claim paper

Related Content

» Fast Boolean Minimizer for Completely Specified Functions

» What Energy Functions Can Be Minimized via Graph Cuts

» Largescale SOP minimization using decomposition and functional properties

» An Improved Evaluation Function for the Bandwidth Minimization Problem

» Minimizing Sparse Higher Order Energy Functions of Discrete Variables

» Minimizing energy functions on 4connected lattices using elimination

» Improvement to the Minimization of Hybrid Error Functions for Pose Alignment

» InkBleed Reduction using Functional Minimization

» An Algorithm for Minimizing the Piecewise Smooth MumfordShah Functional

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1998
Where	DAM
Authors	Akiyoshi Shioura

Comments (0)