2714 search results - page 32 / 543 » Approximation Schemes for Scheduling |
STOC
1995
ACM
15 years 4 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,...
92
Voted
EUROCRYPT
2005
Springer
15 years 6 months ago
2005
Springer
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
109
Voted
SODA
1998
ACM
15 years 1 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
87
Voted
CORR
2002
Springer
15 years 7 days ago
2002
Springer
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any grap...
98
Voted
SIAMSC
2008
15 years 10 days ago
2008
A nine point scheme is presented for discretizing diffusion operators on distorted quadrilateral meshes. The advantage of this method is that highly distorted meshes can be used wi...