We present a random polynomial time algorithm for well-rounding convex bodies K in the following sense: Given K and > 0, the algorithm, with probability at least 1 — , computes two simplices * and **, where ** is the blow up of * from its center by a factor of n + 3, such that Δ*K and vol (K/Δ**)≤ volK. The running time is polynomial in 1 / and L, the size of the input K
AbstractWe give a new recursion formula for the number of convex polyominoes with fixed perimeter. F...
This paper presents an algorithm and its probabilistic analysis for constructing the convex hull of ...
We experimentally study the fundamental problem of computing the volume of a convex polytope given a...
AbstractWe present a random polynomial time algorithm for well-rounding convex bodies K in the follo...
We present a random polynomial time algorithm for well-rounding convex bodies K in the following sen...
SIGLEAvailable from British Library Document Supply Centre- DSC:7769.555(LU-SCS--88-23) / BLDSC - Br...
Abstract: "We discuss the problem of computing the volume of a convex body K in R[superscript n]. We...
htmlabstractWe consider maximising a concave function over a convex set by a simplerandomised algori...
We consider maximising a concave function over a convex set by a simple randomised algorithm. The st...
Given a high dimensional convex body K ⊆ IRn by a separation oracle, we can approx-imate its volume ...
The problem of randomly generating Q-convex sets is considered. We present two generators. The first...
We discuss the problem of computing the volume of a convex body K in IR n . We review worst-case r...
AbstractWe present a new algorithm for computing the volume of a convex body in Rn. The main ingredi...
AbstractThe problem of randomly generating Q-convex sets is considered. We present two generators. T...
AbstractThe convex hull of X1,…,Xn, a sample of independent identically distributed Rd-valued random...
AbstractWe give a new recursion formula for the number of convex polyominoes with fixed perimeter. F...
This paper presents an algorithm and its probabilistic analysis for constructing the convex hull of ...
We experimentally study the fundamental problem of computing the volume of a convex polytope given a...
AbstractWe present a random polynomial time algorithm for well-rounding convex bodies K in the follo...
We present a random polynomial time algorithm for well-rounding convex bodies K in the following sen...
SIGLEAvailable from British Library Document Supply Centre- DSC:7769.555(LU-SCS--88-23) / BLDSC - Br...
Abstract: "We discuss the problem of computing the volume of a convex body K in R[superscript n]. We...
htmlabstractWe consider maximising a concave function over a convex set by a simplerandomised algori...
We consider maximising a concave function over a convex set by a simple randomised algorithm. The st...
Given a high dimensional convex body K ⊆ IRn by a separation oracle, we can approx-imate its volume ...
The problem of randomly generating Q-convex sets is considered. We present two generators. The first...
We discuss the problem of computing the volume of a convex body K in IR n . We review worst-case r...
AbstractWe present a new algorithm for computing the volume of a convex body in Rn. The main ingredi...
AbstractThe problem of randomly generating Q-convex sets is considered. We present two generators. T...
AbstractThe convex hull of X1,…,Xn, a sample of independent identically distributed Rd-valued random...
AbstractWe give a new recursion formula for the number of convex polyominoes with fixed perimeter. F...
This paper presents an algorithm and its probabilistic analysis for constructing the convex hull of ...
We experimentally study the fundamental problem of computing the volume of a convex polytope given a...