Sciweavers

985 search results - page 104 / 197
» Piercing Convex Sets
Sort
View
ISAAC
2005
Springer
91views Algorithms» more  ISAAC 2005»
15 years 10 months ago
Sparse Geometric Graphs with Small Dilation
Given a set S of n points in RD , and an integer k such that 0 k < n, we show that a geometric graph with vertex set S, at most n − 1 + k edges, maximum degree five, and dila...
Boris Aronov, Mark de Berg, Otfried Cheong, Joachi...
CORR
2010
Springer
91views Education» more  CORR 2010»
15 years 4 months ago
Structure of Extreme Correlated Equilibria
We exhibit the rich structure of the set of correlated equilibria by analyzing the simplest of polynomial games: the mixed extension of matching pennies. We show that while the co...
Noah D. Stein, Asuman E. Ozdaglar, Pablo A. Parril...
IJAR
2008
99views more  IJAR 2008»
15 years 4 months ago
Unifying practical uncertainty representations. II: Clouds
There exist many tools for capturing imprecision in probabilistic representations. Among them are random sets, possibility distributions, probability intervals, and the more recen...
Sébastien Destercke, Didier Dubois, Eric Ch...
MOR
2010
113views more  MOR 2010»
15 years 2 months ago
Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs
We consider the mixed integer version of bipartite vertex cover. This is equivalent to the mixed integer network dual model, recently introduced in [2], that generalizes several m...
Michele Conforti, Laurence A. Wolsey, Giacomo Zamb...
MP
2010
81views more  MP 2010»
15 years 2 months ago
Lifting inequalities: a framework for generating strong cuts for nonlinear programs
In this paper, we propose lifting techniques for generating strong cuts for nonlinear programs that are globally-valid. The theory is geometric and provides intuition into lifting...
Jean-Philippe P. Richard, Mohit Tawarmalani