Presentation 2018-12-12
Minimization of an M-convex Function under L1-distance Constraint
Akiyoshi Shioura,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper we consider a new problem of minimizing an M-convex function under L1-distance constraint (MML1); the constraint is given by an upper bound for L1-distance between a feasible solution and a given “center.” We present a pseudo-polynomial-time algorithm for (MML1) based on steepest descent approach. We also propose two polynomial-time algorithms for (MML1) by replacing the L1-distance constraint with a simple linear constraint.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) discrete convex analysis / discrete convex function / nonlinear integer programming problem / polynomial-time algorithm
Paper # COMP2018-33
Date of Issue 2018-12-05 (COMP)

Conference Information
Committee COMP
Conference Date 2018/12/12(1days)
Place (in Japanese) (See Japanese page)
Place (in English) Tohoku University
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair Toshihiro Fujito(Toyohashi Univ. of Tech.)
Vice Chair Shinichi Nakano(Gunma Univ.)
Secretary Shinichi Nakano(Kyoto Univ.)
Assistant Kazuhisa Seto(Seikei Univ.)

Paper Information
Registration To Technical Committee on Theoretical Foundations of Computing
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Minimization of an M-convex Function under L1-distance Constraint
Sub Title (in English)
Keyword(1) discrete convex analysis
Keyword(2) discrete convex function
Keyword(3) nonlinear integer programming problem
Keyword(4) polynomial-time algorithm
1st Author's Name Akiyoshi Shioura
1st Author's Affiliation Tokyo Institute of Technology(Tokyo Inst. Tech.)
Date 2018-12-12
Paper # COMP2018-33
Volume (vol) vol.118
Number (no) COMP-356
Page pp.pp.15-20(COMP),
#Pages 6
Date of Issue 2018-12-05 (COMP)