STOC
1995
ACM
14 years 9 months ago
1995
ACM
STOC
1995
ACM
14 years 9 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
STOC
1995
ACM
14 years 9 months ago
1995
ACM
STOC
1997
ACM
14 years 9 months ago
1997
ACM
STOC
1997
ACM
14 years 9 months ago
1997
ACM
ISAAC
1995
Springer
14 years 9 months ago
1995
Springer
ISAAC
1995
Springer
14 years 9 months ago
1995
Springer
Abstract. The minimum-redundancy prefix codeproblem is to deter
ISAAC
1995
Springer
14 years 9 months ago
1995
Springer
An extended abstract of this paper will be presented at the Sixth Annual International Symposium on Algorithms and Computation.
ISAAC
1995
Springer
14 years 9 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
ISAAC
1995
Springer
14 years 9 months ago
1995
Springer
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...