Sciweavers

13 search results - page 1 / 3
» A Generalization of Nemhauser and Trotter's Local Optimizati...
Sort
View
58
Voted
STACS
2009
Springer
15 years 4 months ago
A Generalization of Nemhauser and Trotter's Local Optimization Theorem
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf ...
60
Voted
SIAMDM
2010
106views more  SIAMDM 2010»
14 years 8 months ago
An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications
Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
68
Voted
ICDCS
2010
IEEE
15 years 1 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»
15 years 3 months 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
15 years 2 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