arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1205.0175cs.DS
收藏

稀疏覆盖规划的在线逼近

Approximating Sparse Covering Integer Programs Online

Anupam Gupta, Viswanath Nagarajan

摘要:

覆盖整数规划(CIP)是一种数学规划,其形式为:min {c^T x:Ax >= 1,0 <= x <= u,x integer},其中A是一个m × n矩阵,c和u是n维向量,都有非负项。在在线设置中,约束(即,约束矩阵A)的行随时间到达,并且算法只能增加向量x的坐标以保持可行性。作为中间步骤,我们考虑在线求解覆盖线性规划(CLP),其中x上的完整性要求被丢弃。我们的主要结果是(a)O(log k)-竞争在线算法求解CLP,和(b)O(log k log L)-竞争随机在线算法求解CIP。这里,k<=n和L<=m分别表示约束矩阵A的任意行和列中的非零条目的最大数量。根据Feige和Korman的结果,这是多项式时间在线算法的最佳可能,即使在集合覆盖的特殊情况下也是如此。

英文摘要:

A covering integer program (CIP) is a mathematical program of the form: min {c^T x : Ax >= 1, 0 <= x <= u, x integer}, where A is an m x n matrix, and c and u are n-dimensional vectors, all having non-negative entries. In the online setting, the constraints (i.e., the rows of the constraint matrix A) arrive over time, and the algorithm can only increase the coordinates of vector x to maintain feasibility. As an intermediate step, we consider solving the covering linear program (CLP) online, where the integrality requirement on x is dropped. Our main results are (a) an O(log k)-competitive online algorithm for solving the CLP, and (b) an O(log k log L)-competitive randomized online algorithm for solving the CIP. Here k<=n and L<=m respectively denote the maximum number of non-zero entries in any row and column of the constraint matrix A. By a result of Feige and Korman, this is the best possible for polynomial-time online algorithms, even in the special case of set cover.

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

↑