✦ LIBER ✦

M-convex functions and tree metrics

✍ Scribed by Hiroshi Hira; Kazuo Murota

Book ID: 105722630
Publisher: Japan Society for Industrial and Applied Mathematics
Year: 2004
Tongue: English
Weight: 717 KB
Volume: 21
Category: Article
ISSN: 0916-7005
DOI: 10.1007/bf03167590

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

ℱK-convex functions on metric spaces

✍ Stephanie Alexander; Richard L. Bishop 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 192 KB

Φ-Convex Functions Defined on Metric Spa

Φ-Convex Functions Defined on Metric Spaces

✍ S. Rolewicz 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 255 KB

Quasi M-convex and L-convex functions—qu

Quasi M-convex and L-convex functions—quasiconvexity in discrete optimization

✍ Kazuo Murota; Akiyoshi Shioura 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 298 KB

We introduce two classes of discrete quasiconvex functions, called quasi M-and L-convex functions, by generalizing the concepts of M-and L-convexity due to Murota (Adv. Math. 124 (1996) 272) and (Math. Programming 83 (1998) 313). We investigate the structure of quasi Mand L-convex functions with res

On approximation of convex functions by

On approximation of convex functions by rational ones in integral metrics

✍ А. Хатамов 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 276 KB

Total dominating functions in trees: Min

Total dominating functions in trees: Minimality and convexity

✍ E. J. Cockayne; C. M. Mynhardt; Bo Yu 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 380 KB

## Abstract A total dominating function (TDF) of a graph __G__ = (__V, E__) is a function __f__: __V__ ← [0, 1] such that for each __v__ ϵ V, Σ~uϵN(v)~ f(u) ≥ 1 (where __N__(__v__) denotes the set of neighbors of vertex __v__). Convex combinations of TDFs are also TDFs. However, convex combinations

Extension of M-Convexity and L-Convexity

Extension of M-Convexity and L-Convexity to Polyhedral Convex Functions

✍ Kazuo Murota; Akiyoshi Shioura 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 454 KB

The concepts of M-convex and L-convex functions were proposed by Murota in 1996 as two mutually conjugate classes of discrete functions over integer lattice points. M/L-convex functions are deeply connected with the well-solvability in nonlinear combinatorial optimization with integer variables. In