scientific article; zbMATH DE number 1962828

zbMath1035.68079MaRDI QIDQ4418665

Liadan O'Callaghan, Rina Panigrahy, Chris Olston, Tomás Feder, Rajeev Motwani

Publication date: 11 August 2003

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

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (2)

The update complexity of selection and related problems ⋮ The robust knapsack problem with queries

This page was built for publication: