Search Sciweavers | Sciweavers

2957 search results - page 8 / 592

» The Complexity of Polynomial-Time Approximation

click to vote

ISAAC
2003
Springer

129views Algorithms» more ISAAC 2003»

Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution

15 years 2 months ago

Download www.keisu.t.u-tokyo.ac.jp

Abstract. In this paper, we propose a Markov chain for sampling a random vector distributed according to a discretized Dirichlet distribution. We show that our Markov chain is rapi...

Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani

claim paper

Read More »

click to vote

FOCS
2000
IEEE

97views Theoretical Computer Science» more FOCS 2000»

Polynomial Time Approximation Schemes for Geometric k-Clustering

15 years 1 months ago

Download www.cs.ucla.edu

Rafail Ostrovsky, Yuval Rabani

claim paper

Read More »

click to vote

SODA
1998
ACM

128views Algorithms» more SODA 1998»

A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP

14 years 10 months ago

Download www.mathcs.emory.edu

Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...

Sanjeev Arora, Michelangelo Grigni, David R. Karge...

claim paper

Read More »

click to vote

CORR
2007
Springer

85views Education» more CORR 2007»

Polynomial time algorithms to approximate mixed volumes within a simply exponential factor

14 years 9 months ago

Download www.optimization-online.org

Leonid Gurvits

claim paper

Read More »