Sciweavers

13 search results - page 1 / 3
» A Generalization of Nemhauser and Trotter's Local Optimizati...
Sort
View
STACS
2009
Springer
14 years 1 months ago
A Generalization of Nemhauser and Trotter's Local Optimization Theorem
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf ...
ICDCS
2010
IEEE
13 years 10 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
LION
2007
Springer
138views Optimization» more  LION 2007»
14 years 12 days ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Samuel Rota Bulò, Marcello Pelillo
PLDI
2003
ACM
13 years 11 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers