7150 search results - page 77 / 1430 » An Approximation Algorithm for Approximation Rank |
131
click to vote
STOC
1989
ACM
15 years 4 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...
90
Voted
IPL
2006
15 years 17 days 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...
102
click to vote
STOC
1998
ACM
15 years 4 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...
126
click to vote
JGAA
2007
15 years 14 days 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...
99
Voted
JC
2008
15 years 17 days 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...