94
Voted
WEA
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
51
Voted
WEA
2005
Springer
15 years 4 months ago
2005
Springer
57
Voted
WEA
2005
Springer
15 years 4 months ago
2005
Springer
92
Voted
WEA
2005
Springer
15 years 4 months ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
56
Voted
WEA
2005
Springer
15 years 4 months ago
2005
Springer
51
Voted
WEA
2005
Springer
15 years 4 months ago
2005
Springer
72
Voted
WEA
2005
Springer
15 years 4 months ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
97
Voted
WEA
2005
Springer
15 years 4 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
88
Voted
WDAG
2005
Springer
15 years 4 months ago
2005
Springer
Atomic Broadcast, used for example in state machine replication, requires three communication steps. Optimistic Atomic Broadcast requires only two steps if all processes receive m...
78
Voted
WDAG
2005
Springer
15 years 4 months ago
2005
Springer