✦ LIBER ✦

Divide-and-conquer approximation algorithms via spreading metrics

✍ Scribed by Even, Guy; Naor, Joseph Seffi; Rao, Satish; Schieber, Baruch

Book ID: 125498503
Publisher: Association for Computing Machinery
Year: 2000
Tongue: English
Weight: 313 KB
Volume: 47
Category: Article
ISSN: 0004-5411
DOI: 10.1145/347476.347478

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Divide-and-conquer approximation algorit

Divide-and-conquer approximation algorithms via spreading metrics

✍ Even, Guy; Naor, Joseph Seffi; Rao, Satish; Schieber, Baruch 📂 Article 📅 2000 🏛 Association for Computing Machinery 🌐 English ⚖ 313 KB

Divide-and-Conquer Approximation Algorit

Divide-and-Conquer Approximation Algorithm for Vertex Cover

✍ Ásgeirsson, Eyjólfur Ingi; Stein, Cliff 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 483 KB

Average complexity of divide-and-conquer

Average complexity of divide-and-conquer algorithms

✍ Boris S. Veroy 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 420 KB

Divide-and-conquer algorithms on the hyp

Divide-and-conquer algorithms on the hypercube

✍ Ernst W Mayr; Ralph Werchner 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 946 KB

Approximations and Optimal Geometric Div

Approximations and Optimal Geometric Divide-and-Conquer

✍ J. Matousek 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 487 KB

We give an efficient deterministic algorithm for computing \(\epsilon\)-approximations and \(\epsilon\)-nets for range spaces of bounded VC-dimension. We assume that an \(n\)-point range space \(\Sigma=(X, X)\) of \(V C\)-dimension \(d\) is given to us by an oracle, which given a subset \(A \subsete

Fast algorithms through divide- and comb

Fast algorithms through divide- and combine-and-conquer strategies

✍ José M. Pérez-Jordá 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 83 KB

The fast Fourier transform (FFF) algorithm is explained in a simple and rLovel way. It is shown how the two canonic forms of the Fb"I" (decimation in time and decimation in ,frequency) can be respectively arranged as "combine-and-conquer" or "'divide-and-conquer" algorithms. @