Vershynin abstractusing a number of different algorithms, we can recover approximately a sparse signal with limited noise, i. Computational geometry computer graphics computer vision textile layout vlsi design. Bibliography open problems in sublinear algorithms. The course will cover sublinear algorithms discovered in a variety of areas, including graph theory, algebra, geometry, image analysis and discrete mathematics, and introduce many techniques that are applied to analyzing sublinear algorithms.
A disadvantage of this algorithm and of all typical dynamic algorithms is that it requires. However, for most natural problems the algorithm must use randomization and must give an answer which is in some sense approximate. Euclidean tsp and the euclidean steiner tree problem. Sublinear algorithms for approximating string compressibility. In proceedings of 9th annual european symposium on algorithms esa. Sublinear geometric algorithms bernard chazelle department of computer science princeton university and nec laboratories america, inc. Approximating the weight of the euclidean minimum spanning tree in sublinear time. Problem sets are due every other week at the beginning of class. This thesis consists of two parts unified under the common theme that both of them are concerned with the complexity of geometric problems. This is true even when we consider probabilistic algorithms. The models include streaming algorithms, sublinear time algorithms, property testing algorithms, sub linear query time algorithms with preprocessing, or computing small summaries for large data. They requires indepth knowledge of different mathematical subjects like combinatorics, topology, algebra, differential geometry etc.
Sublinear algorithms workshop january 79, 2016 johns hopkins university, baltimore, md the workshop aims to bring together researchers interested in sublinear algorithms. Important topics within sub linear algorithms include data stream algorithms sub linear space, property testing sub linear time, and communication complexity sub linear communication but this list isnt. Incidentally, our planarization algorithm also solves an open computational geometry problem. In computer science, the time complexity is the computational complexity that describes the amount of time it takes to run an algorithm. Sublinear geometric algorithms proceedings of the thirty. This page provides information about online lectures and lecture slides for use in teaching and learning from the book algorithms, 4e. Sublinear time algorithms have been found for many computational problems, such as checking polygon intersections 3, estimating the cost of a minimum spanning tree. Geometric transforms for fast geometric algorithms carnegie. Theory and some practice of randomized algorithms for matrices and data tutorial from focs 2012 workshop pdf, ppt geometric tools for identifying structure in large social and information networks 1. Sublinear time algorithms sublinear approximation algorithms this survey is a slightly updated version of a survey that appeared in bulletin of the eatcs, 89.
In many of these works, the proof techniques are at least as interesting and important as the results themselves. Next, we present recent sublinear time algorithms for basic graph problems. We will also discuss new directions in sublinear time algorithms, including new computational tasks, new measures for accuracy guarantees, and new models for data access. In this paper we consider the problem of estimating the weight of a minimum spanning tree, where the input is a set of points in the euclidean space. Sublinear time algorithms represent a new paradigm in computing, where an algorithm must. However, it is often the case that massive databases, particularly in a geometric. Floyd 40 and eddy 80 independently discovered a planar convex hull. The input to a computational geometry problem is typically a description of a set of geometric objects, such as a set of points, a set of line segments, or the vertices of a polygon in counterclockwise order. Christian sohler abstract in this paper we survey recent advances in the area of sublineartime algorithms. We then go into more detail about three randomized las vegas algorithms with no extra preprocessing for three geometric problems. The input is a stream of points in rd denoted p p1pn. We study the problem of separating sublinear time computations via approximating the diameter for a sequence sp 1 p 2 p n of points in a metric space, in which any two consecutive points have the same distance. Abstract we provide lineartime algorithms for geometric graphs with sublinearly many crossings.
The goal of this wiki is to collate a set of open problems in sub linear algorithms and to track progress that is made on these problems. Pdf shortest path in a polygon using sublinear space. We give optimal algorithms for intersection detection of convex polygons and polyhedra, point location in twodimensional triangulations and voronoi diagrams, and ray shooting in convex polyhedra, all of which run in expected time o v n, where n is the size of. We provide lineartime algorithms for geometric graphs with sublinearly many crossings. A sublinear time algorithm doesnt even have the time to consider all the input. If preprocessing is allowed, then of course this is an entirely di erent story 3, 23. Algorithmic linear dimension reduction in the 1 norm for sparse vectors a. Pdf lineartime algorithms for geometric graphs with. Cs 468 geometric algorithms seminar winter 20052006 2 overview what is this paper about. Since the location of a single point may dramatically in. Important topics within sublinear algorithms include data stream algorithms sublinear space, property testing sublinear time, and communication complexity sublinear communication but this list isnt. The goal of this wiki is to collate a set of open problems in sublinear algorithms and to track progress that is made on these problems. Approximating the weight of the euclidean minimum spanning.
R, where cpx represents the cost of using x as a solution \center for input p. Constructing a sublinear time algorithm may seem to be an impossible task since it allows one to read only a small fraction of the input. If the limit is 0, this means the function, fn, is sublinear. Binary search is not considered a sublinear time algorithm because the ordering property allows an accurate algorithm in less than linear time. Finding heavy hitters in streams april 9, 2014 lecturer. Sublinear time is a daunting goal since it allows one to read only a miniscule fraction of the input. To the best of our knowledge, there has not been any work done on sublinear time algorithms applied in distributed mrs, with only some work in randomized algorithms for robotic motion and path planning. Chen february 7, 2006 abstract for many geometric problems, there are e. Sublinear geometric algorithms and geometric lower bounds. Otherwise it grows at the same approximate speed of n or faster.
Sublinear geometric algorithms we start by discussing the main approaches to sublinear algorithm design as well as the basic types of randomized algorithms. For example, checkingwhether a point lies in a convex. We present the main ideas behind recent algorithms for estimating the cost of minimum spanning tree 21 and facility location 10, and then we discuss the quality of random sampling to obtain sublineartime algorithms for clustering problems 22, 49. Intersection ray shooting volume approximation shortest path approximation intersection ray shooting volume approximation shortest. Given a euclidean graph g over a set p of n points in the plane, we are interested in verifying whether g is an euclidean minimum spanning tree emst of p or g differs from it in more than n edges. Implicit regularization in sublinear approximation algorithms pdf, ppt.
Msri mathematical foundations of geometric algorithms. Sublinear time algorithms school of mathematical sciences. Already have solutions for old nphard problems traveling salesman, steiner tree, etc. Given two convex polyhedra, check if they intersect. Much later in history, in the early seventeenth century, fermat and descartes introduced the idea of using a linear coordinate system to specify point locations, using algebraic equations to describe geometric objects such as lines, and using algebra to solve geometric problems such as computing the intersection point of two lines. Sublinear algorithms for optimization and machine learning. Sublinear geometric algorithms connecting repositories. We give optimal algorithms for intersection detection of convex polygons and polyhedra, point location in twodimensional delaunay triangulations and voronoi diagrams, and ray shooting in convex polyhedra, all of which run in time ovn, where n is the size of the input. There are problems for which deterministic exact sublinear time algorithms are known. Parallel algorithms for geometric graph problems grigory. Sublinear and streaming algorithms spring 2014 lecture 4. We also provide sublinear solutions for the approximate evaluation of the volume of a convex polytope and the length of the shortest path between two points on the boundary. Artur czumaj christian sohler abstract in this paper we survey recent advances in the area of sublineartime algorithms. Approximating geometric problems in parallel models geometric graph implicit.
For example, they lead to onpolylogn expectedtime randomized o1approximation algorithms for both hitting set and set cover if. In paola flocchini and leszek gasieniec, editors, structural information and communication complexity, th international colloquium, sirocco 2006, chester, uk, july 25, 2006, proceedings, volume 4056 of lecture notes in computer science, pages 280294. These lectures are appropriate for use by instructors as the basis for a flipped class on the subject, or for selfstudy by individuals. We give optimal algorithms for intersection detection of convex polygons and polyhedra, poin. In the case of sublinear, we want to prove that a function grows slower than cn, where c is some positive number. Nearlinear algorithms for geometric hitting sets and set covers pankaj k. Second, sublinear algorithms 17 also work with a structureless data. Pdf 336 kb 2010 algorithms for approximate shortest. Sublineartime approximation of euclidean minimum spanning tree. Recently, sublinear algorithms were designed for various problems, including geometric problems.
Chazelle, liu and magen showed that for arbitrary dt, the point location without preprocessing can be done in time 3. Stochastic algorithms with geometric step decay converge. Online geometric reconstruction journal of the acm. The mathematical sciences research institute msri, founded in 1982, is an independent nonprofit mathematical research institution whose funding sources include the national science foundation, foundations, corporations, and more than 90 universities and institutions. Asaf shapira abstract sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a very small portion of the input. Lineartime algorithms for geometric graphs with sublinearly. Sublinear geometric algorithms, for convex polygons 2d and convex polyhedra 3d intersection. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform.
The number of spikes in the output can be controlled. Sublinear time and space algorithms 2018b lecture 10 geometric streams and coresets robert krauthgamer 1 geometric streams and coresets geometric stream. Aug 16, 2016 inspired by these results, we introduce a computational model based on conditional sampling to develop sublinear algorithms with exponentially faster runtimes compared to standard sublinear algorithms. However, in recent years, we have seen development of sublinear time algorithms for optimization problems arising in such diverse areas as graph theory, geometry, algebraic computations, and computer graphics. For example, we do not touch upon the body of work on sublinear algorithms 19 or on property testing in the geometric context 23. Minimum spanning tree clustering, vision minimum cost bichromatic matching vision. Sublineartime algorithms umd department of computer science.
In this work, we ask whether geometric step decay similarly improves stochastic algorithms for the class of sharp nonconvex problems. We focus on geometric optimization problems over points in high dimensional euclidean space. The institute is located at 17 gauss way, on the university of california, berkeley campus, close to. The problems we consider include intersection detection of convex polygons and polyhedra, point location in twodimensional voronoi diagrams and triangulations, ray shooting towards convex polyhedra, and nearest neighbor type problems. Such losses feature in modern statistical recovery problems and lead to a new challenge not present in the convex set. The models include streaming algorithms, sublinear time algorithms, property testing algorithms, sublinear query time algorithms with preprocessing, or computing small summaries for large data. These algorithms are designed to solve geometric problems. That is, we provide algorithms running in on time on connected geometric graphs having n vertices and k crossings, where k is smaller than n by an iterated logarithmic factor. We will study different models appropriate for sublinear algorithms. Separating sublinear time computations by approximate. In this thesis, we present algorithms and prove lower bounds for fundamental computational problems in the models that address massive data sets.
Geometric algorithms princeton university computer science. We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We also provide sublinear solutions for the approximate evaluation of the volume of a convex polytope and the length of the shortest path between two points on. We give optimal algorithms for intersection detection of convex polygons and polyhedra, point location in twodimensional triangulations and voronoi diagrams, and ray shooting in convex polyhedra, all of which run in expected time o v n, where n is the size of the input.
That is, we provide algorithms running in on time on connected geometric graphs hav ing n. In particular, the work of elad hazan and his collaborators have produced a sublinear approach that can be applied to several optimization problems that arise in machine learning. Sublineartime algorithms computer science department. Comparing slopes of two lines, finding equation of a plane etc. In this course we will cover such algorithms, which can be used for the analysis of distributions, graphs, data streams and highdimensional realvalued data. The topic this quarter is geometric approximation algorithms. Branch that studies algorithms for geometric problems typically, input is a set of points, line segments etc. Bernard chazelle, ding liu, and avner magen abstract. Faster sublinear algorithms using conditional sampling.
Towards inplace geometric algorithms and data structures. Even among the results that we do cover, the choice of topics. They also mentioned that jumpandwalk was in fact the rst sublinear geometric algorithm s of course, with. Thus, for each function, fn, in your list, we want the ratio of fn to cn. Other similar courses include sublinear algorithms at mit, algorithms for big data at harvard, and sublinear algorithms for big datasets at the university of buenos aires. In computational geometry, there have been a few recent papers. Pdf sublineartime approximation of euclidean minimum. Algorithmic linear dimension reduction in the norm for. Large geometric datasets often call for algorithms that examine only a small fraction of the input, but it is fair to say that sublinear computational geometry is still. Sublinear time and space algorithms 2018b lecture 10.
Nearlinear algorithms for geometric hitting sets and set. The intention is to really go into the details of the arguments. We present the main ideas behind recent algorithms for estimating the cost of minimum spanning tree 21 and facility location 10, and then we discuss the quality of random sampling to obtain sublinear time algorithms for clustering problems 22, 49. Sublinear geometric algorithms, for convex polygons 2d and convex polyhedra 3d. Sublinear time algorithms have been found for many computational problems, such as checking polygon intersections 3, estimating the cost of a minimum spanning tree 4,9,10, finding geometric. The first part of this thesis initiates a study of sublinear algorithms for geometric problems in two and three dimensions when no preprocessing is allowed. Approximate characterization of multirobot swarm shapes. In the past few years, there have been several works discussing the use of sublinear algorithms to solve problems relevant to machine learning. Note that randomization is a necessity because, in a deter ministic setting, most problems in computational geometry require looking at the entire input. In proceedings of 14th annual symposium on discrete algorithms soda. Sublinear geometric algorithms siam journal on computing. We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions.
1500 1341 372 808 172 1335 1278 469 998 222 1549 872 786 272 807 1104 698 1392 405 32 334 40 189 803 1229 455 95 1375 1435 754 1278 1309 1432