Sciweavers

2636 search results - page 76 / 528
» Linear Programming
Sort
View
COCO
2007
Springer
107views Algorithms» more  COCO 2007»
15 years 4 months ago
A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover
We study semidefinite programming relaxations of Vertex Cover arising from repeated applications of the LS+ “lift-and-project” method of Lovasz and Schrijver starting from th...
Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani
COR
2006
91views more  COR 2006»
14 years 10 months ago
An LP approach to compute the pre-kernel for cooperative games
We present an algorithm to compute the (pre)-kernel of a TU-game N, v with a system of n 2 1 linear programming problems. In contrast to the algorithms using convergence methods t...
Holger Meinhardt
ICALP
2009
Springer
15 years 10 months ago
The Tile Complexity of Linear Assemblies
Harish Chandran, Nikhil Gopalkrishnan, John H. Rei...
JELIA
2010
Springer
14 years 8 months ago
A Normal Form for Linear Temporal Equilibrium Logic
In previous work, the so-called Temporal Equilibrium Logic (TEL) was introduced. This formalism provides an extension of the Answer Set semantics for logic programs to arbirary the...
Pedro Cabalar
FSTTCS
2006
Springer
15 years 1 months ago
Validity Checking for Finite Automata over Linear Arithmetic Constraints
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
Gary Wassermann, Zhendong Su