7150 search results - page 77 / 1430 » An Approximation Algorithm for Approximation Rank |
140
click to vote
STOC
1989
ACM
15 years 6 months ago
1989
ACM
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
101
click to vote
IPL
2006
15 years 2 months ago
2006
We study the NP-hard problem of labeling points with maximum-radius circle pairs: given n point sites in the plane, find a placement for 2n interior-disjoint uniform circles, such...
119
Voted
STOC
1998
ACM
15 years 6 months ago
1998
ACM
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
144
click to vote
JGAA
2007
15 years 2 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
119
click to vote
JC
2008
15 years 2 months ago
2008
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...