Conventional WiFi networks perform channel contention in time domain. This is known to be wasteful because the channel is forced to remain idle, while all contending nodes are bac...
Souvik Sen, Romit Roy Choudhury, Srihari Nelakudit...
Integer programs deļ¬ned by two equations with two free integer variables and nonnegative continuous variables have three types of nontrivial facets: split, triangle or quadrilat...
Lifting is a procedure for deriving valid inequalities for mixed-integer sets from valid inequalities for suitable restrictions of those sets. Lifting has been shown to be very eļ¬...
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
We prove that if G = (VG, EG) is a ļ¬nite, simple, and undirected graph with Īŗ components and independence number Ī±(G), then there exist a positive integer k ā N and a functi...
A k-query locally decodable code (LDC) C : n N encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordina...
Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang,...
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
Recently, Andersen et al. [1], Borozan and CornuĀ“ejols [7] and CornuĀ“ejols and Margot [10] characterized extreme inequalities of a system of two rows with two free integer varia...
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...