首页/论文/2007.09618

arXiv 2007.096182020-07math.CO

Decreasing Minimization on M-convex Sets: Algorithms and Applications

András Frank, Kazuo Murota

备注：: 35 pages. This is a revised version of the second half of "A. Frank and K. Murota; Discrete decreasing minimization, PartI: Base-polyhedra with applications in network optimization" arXiv:1808.07600

英文摘要：

This paper is concerned with algorithms and applications of decreasing minimization on an M-convex set, which is the set of integral elements of an integral base-polyhedron. Based on a recent characterization of decreasingly minimal (dec-min) elements, we develop a strongly polynomial algorithm for computing a dec-min element of an M-convex set. The matroidal feature of the set of dec-min elements makes it possible to compute a minimum cost dec-min element, as well. Our second goal is to exhibit various applications in matroid and network optimization, resource allocation, and (hyper)graph orientation. We extend earlier results on semi-matchings to a large degree by developing a structural description of dec-min in-degree bounded orientations of a graph. This characterization gives rise to a strongly polynomial algorithm for finding a minimum edge-cost dec-min orientation.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Decreasing Minimization on Base-Polyhedra: Relation Between Discrete and Continuous Cases

This paper is concerned with the relationship between the discrete and the continuous decreasing minimization problem on base-polyhedra. The continuous version (under the name of lexicographically optimal base of a polymatroid) was solved by Fujishige in 1980, with subsequent elaborations described in his book (1991). The discrete counterpart of the dec-min problem (concerning M-convex sets) was settled only recently by the present authors, with a strongly polynomial algorithm to compute not only a single decreasing minimal element but also the matroidal structure of all decreasing minimal ele…

2022-04-12math.CO

Discrete Decreasing Minimization, Part II: Views from Discrete Convex Analysis

We continue to consider the discrete decreasing minimization problem on an integral base-polyhedron treated in Part I. The problem is to find a lexicographically minimal integral vector in an integral base-polyhedron, where the components of a vector are arranged in a decreasing order. This study can be regarded as a discrete counter-part of the work by Fujishige (1980) on the lexicographically optimal base and the principal partition of a base-polyhedron in continuous variables. The objective of Part II is two-fold. The first is to offer structural views from discrete convex analysis (DCA) on…

2020-06-30math.CO

关于积分凸集上递减最小化的一个结构定理的两种证明

Two Proofs of a Structural Theorem of Decreasing Minimization on Integrally Convex Sets

本文针对积分凸集上递减最小化（字典序优化）的结构定理，分别利用Fenchel型对偶定理与Farkas引理给出两种证明，阐明递减最小元素集为单位离散立方体与凸包某面的交集。

2025-04-24math.COmath.OC

关于拟M$^\ atural$-凸函数最小化的注记

Note on Minimization of Quasi M$^\natural$-convex Functions

本文研究了半严格拟M$^\ atural$-凸函数的最小化问题，发现其具有与M$^\ atural$-凸函数相同的最优性条件和较弱的极小值割性质，但测地性质和邻近性质不成立。

2023-11-27math.CO

凸整数极小化的多项式预言时间算法

A polynomial oracle-time algorithm for convex integer minimization

在本文中，我们考虑的解决方案，某些凸整数极小化问题的贪婪增广程序。我们表明，一个贪婪的增广过程，只需要多项式的许多增广步骤来解决给定的问题，只采用某些Graver基地的方向。我们将这些结果推广到凸$N$倍整数极小化问题和凸2阶段随机整数极小化问题。最后，我们提出了一些应用的凸$N$倍整数最小化问题，我们的方法提供了多项式时间的解决方案的算法。

2007-10-16math.COmath.OC

Decreasing Minimization on M-convex Sets: Background and Structures

The present work is the first member of a pair of papers concerning decreasingly-minimal (dec-min) elements of a set of integral vectors, where a vector is dec-min if its largest component is as small as possible, within this, the next largest component is as small as possible, and so on. This discrete notion, along with its fractional counterpart, showed up earlier in the literature under various names. The domain we consider is an M-convex set, that is, the set of integral elements of an integral base-polyhedron. A fundamental difference between the fractional and the discrete case is that a…

2021-07-16math.CO

更多相关论文收起更多论文

关于拟L$^{\ atural}$-凸函数最小化的最速下降算法的注记

Note on Steepest Descent Algorithm for Quasi L$^{\natural}$-convex Function Minimization

该研究定义了半严格拟L$^{\ atural}$-凸函数这类离散拟凸函数，证明L$^{\ atural}$-凸函数最小化的最速下降算法对其适用，并拓展迭代次数分析，揭示该算法的测地性质。

2023-07-21math.COmath.OC

Discrete Decreasing Minimization, Part I: Base-polyhedra with Applications in Network Optimization

Borradaile et al. (2017) investigated orientations of an undirected graph in which the sequence of in-degrees of the nodes is lexicographically minimal, which we call decreasingly minimal (=dec-min). They proved that an orientation is dec-min if and only if there is no dipath from $s$ to $t$ with in-degrees $\varrho (t) \geq \varrho (s)+2$. They conjectured that an analogous statement holds for strongly connected dec-min orientations, as well. We prove not only this conjecture but its extension to $k$-edge-connected orientations, as well. We also provide a solution to a discrete version of Meg…

2019-07-09math.CO

Distributed Submodular Minimization And Motion Coordination Over Discrete State Space

We develop a framework for the distributed minimization of submodular functions. Submodular functions are a discrete analog of convex functions and are extensively used in large-scale combinatorial optimization problems. While there has been significant interest in the distributed formulations of convex optimization problems, distributed minimization of submodular functions has received relatively little research attention. Our framework relies on an equivalent convex reformulation of a submodular minimization problem, which is efficiently computable. We then use this relaxation to exploit met…

2018-01-21math.COmath.OC

Constructive discrepancy minimization for convex sets

A classical theorem of Spencer shows that any set system with n sets and n elements admits a coloring of discrepancy O(n^1/2). Recent exciting work of Bansal, Lovett and Meka shows that such colorings can be found in polynomial time. In fact, the Lovett-Meka algorithm finds a half integral point in any "large enough" polytope. However, their algorithm crucially relies on the facet structure and does not apply to general convex sets. We show that for any symmetric convex set K with measure at least exp(-n/500), the following algorithm finds a point y in K \cap [-1,1]^n with Omega(n) coordinates…

2016-04-12cs.CGcs.DMmath.CO