Sciweavers

HOTNETS
2010
13 years 1 months ago
Listen (on the frequency domain) before you talk
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...
MP
2011
13 years 1 months ago
On the relative strength of split, triangle and quadrilateral cuts
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...
Amitabh Basu, Pierre Bonami, Gérard Cornu&e...
MP
2011
13 years 1 months ago
Lifting for conic mixed-integer programming
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ļ¬...
Alper Atamtürk, Vishnu Narayanan
DCG
2011
13 years 1 months ago
Small Grid Embeddings of 3-Polytopes
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...
Ares Ribó Mor, Günter Rote, Andr&eacut...
DAM
2011
13 years 1 months ago
Independence in connected graphs
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...
Jochen Harant, Dieter Rautenbach
CORR
2010
Springer
230views Education» more  CORR 2010»
13 years 2 months ago
Query-Efficient Locally Decodable Codes of Subexponential Length
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,...
EOR
2010
140views more  EOR 2010»
13 years 3 months ago
Cutting plane algorithms for 0-1 programming based on cardinality cuts
: 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...
Osman Oguz
CC
2010
Springer
117views System Software» more  CC 2010»
13 years 3 months ago
Efficiently Certifying Non-Integer Powers
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...
Erich Kaltofen, Mark Lavin
MP
2010
126views more  MP 2010»
13 years 4 months ago
Two row mixed-integer cuts via lifting
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...
Santanu S. Dey, Laurence A. Wolsey
MP
2010
128views more  MP 2010»
13 years 4 months ago
Perspective reformulations of mixed integer nonlinear programs with indicator variables
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 ...
Oktay Günlük, Jeff Linderoth