eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2006-08-28
5291
1
18
10.4230/DagSemProc.05291.1
article
05291 Abstracts Collection – Sublinear Algorithms
Czumaj, Artur
Muthukrishnan, S. Muthu
Rubinfeld, Ronitt
Sohler, Christian
From 17.07.05 to 22.07.05, the Dagstuhl Seminar
05291 ``Sublinear Algorithms'' was held
in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol05291/DagSemProc.05291.1/DagSemProc.05291.1.pdf
Property testing
sublinear time approximation algorithms
data streaming algorithms
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2006-08-28
5291
1
0
10.4230/DagSemProc.05291.2
article
Approximating Average Parameters of Graphs
Goldreich, Oded
Ron, Dana
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph.
Specifically, we consider the average degree of a graph and the average distance between pairs of vertices in a graph.
Since our focus is on sublinear algorithms, these algorithms access the input graph via queries to an adequate oracle.
We consider two types of queries.
The first type is standard neighborhood queries (i.e., what is the i'th neighbor of vertex v?), whereas the second type are queries regarding the quantities that we need to find the average of (i.e., what is the degree of vertex v? and what is the distance between u and v, respectively).
Loosely speaking, our results indicate a difference between the two problems: For approximating the average degree, the standard neighbor queries suffice and in fact are preferable to degree queries. In contrast, for approximating average distances, the standard neighbor queries are of little help whereas distance queries are crucial.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol05291/DagSemProc.05291.2/DagSemProc.05291.2.pdf
Graph parameters
degree
distance
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2006-08-28
5291
1
0
10.4230/DagSemProc.05291.3
article
Contemplations on Testing Graph Properties
Goldreich, Oded
This note documents two programmatic comments regarding testing graph properties, which I made during the workshop. The first comment advocates paying more attention to the dependence of the tester's complexity on the proximity parameter.
The second comment advocates paying more attention to the question of testing general graphs (rather than dense or bounded-degree ones).
In addition, this note includes a suggestion to view property testing within the framework of promise problems.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol05291/DagSemProc.05291.3/DagSemProc.05291.3.pdf
Property testing
graph properties
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2006-08-28
5291
1
18
10.4230/DagSemProc.05291.4
article
Sublinear Geometric Algorithms
Chazelle, Bernard
Liu, Ding
Magen, Avner
We present sublinear algorithms to such problems as Detecting of Polytope intersection, Shortest Path on 3D convex Polytopes and volume approximation.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol05291/DagSemProc.05291.4/DagSemProc.05291.4.pdf
Sublinear algorithms
computational geometry