scientific article; zbMATH DE number 1947429

zbMath1019.68820MaRDI QIDQ4411398

Ojas Parekh, R. Ravi, Eduardo Sany Laber

Publication date: 8 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2461/24610649.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

A randomized competitive algorithm for evaluating priced AND/OR trees

This page was built for publication: