On locality and related problems: Communicating, computing, exploring

Locality is a peculiarity which is exhibited by many problems appearing in the most disparate domains of theoretical computer science and mathematics. In this thesis, we demonstrate this assertion by studying three classes of problems that are related to the task of communicating, computing and exploring, respectively. By a local problem, we understand a problem which is easily solved if the problem solver(s) would have access to the whole instance at once. However, the difficulty is that the problem solver is allowed to initially look only at a small portion of the instance, and at every point of the resolution process she gets a small piece of new information that depends on her choices and on the model she is operating with. The problem solver incurs a unit cost when she gets a new information, but can work with the information she already has for free. In the first part of this thesis we focus on the process of communication. We introduce and study the so called algebraic communication complexity of a multivariate polynomial or rational function. In this model two or more players aim to evaluate a rational function according to some input. However the input is distributed among the players. Hence, they exchange messages in such a way that eventually a player is able to correctly determine the value of the function at the given input. Our goal is to determine the least number of messages that are required to solve the task for every given input. We propose different techniques that establish lower bounds for this complexity measure. We apply these results to show that a broad class of multicast cost sharing mechanisms – namely truthful budget-balanced mechanisms – need to send many messages in a network in the worst case during the resolution process. In the second part we deal with the realm of computation. We focus on distributed algorithms for wireless sensor networks. In such a network, every node is a computational unit that performs some actions. However, its view is limited to the set of nodes that can be reached through direct communication with its wireless equipment. As an algorithm progresses, each node gathers more information about the network topology. We start with the observation that many such algorithms require to solve some graph-theoretical problem during their execution. Hence a good understanding of the locality of such problems is much needed. In this thesis we design

[1]  P. Erdös,et al.  On the structure of linear graphs , 1946 .

[2]  Roger Wattenhofer,et al.  Tight bounds for distributed selection , 2007, SPAA '07.

[3]  Steven M. LaValle,et al.  Visibility-Based Pursuit-Evasion in an Unknown Planar Environment , 2004, Int. J. Robotics Res..

[4]  E. Kushilevitz,et al.  Communication Complexity: Basics , 1996 .

[5]  Joseph S. B. Mitchell,et al.  Geometric Shortest Paths and Network Optimization , 2000, Handbook of Computational Geometry.

[6]  Moni Naor,et al.  A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring , 1991, SIAM J. Discret. Math..

[7]  Shay Kutten,et al.  Fast Distributed Construction of Small k-Dominating Sets and Applications , 1998, J. Algorithms.

[8]  Johann Hurink,et al.  A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs , 2005, WAOA.

[9]  V. Chvátal.  A combinatorial theorem in plane geometry , 1975 .

[10]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[11]  D. T. Lee,et al.  Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

[12]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[13]  Subir Kumar Ghosh,et al.  Visibility Algorithms in the Plane , 2007 .

[14]  S. Healy,et al.  Differences in cue use and spatial memory in men and women , 2006, Proceedings of the Royal Society B: Biological Sciences.

[15]  Fred B. Schneider,et al.  Synchronization in Distributed Programs , 1982, TOPL.

[16]  Xiuzhen Cheng,et al.  Connected Dominating Set in Sensor Networks and MANETs , 2004 .

[17]  Thomas Moscibroda,et al.  What Cannot Be Computed Locally , 2004 .

[18]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[19]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[20]  Fabian Kuhn,et al.  Ad-hoc networks beyond unit disk graphs , 2003, DIALM-POMC '03.

[21]  F. Bullo,et al.  Distributed deployment of asynchronous guards in art galleries , 2006, 2006 American Control Conference.

[22]  Dima Grigoriev.  Probabilistic Communication Complexity Over The Reals , 2008, computational complexity.

[23]  Michael A. Bender,et al.  Optimal sparse matrix dense vector multiplication in the I/O-model , 2007, SPAA.

[24]  Roger Wattenhofer,et al.  The Complexity of Connectivity in Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[25]  Steven Skiena,et al.  Hamiltonian triangulations for fast rendering , 1996, The Visual Computer.

[26]  Peng-Jun Wan,et al.  Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.

[27]  Khaled M. Alzoubi.  Connected dominating set and its induced position-less sparse spanner for mobile ad hoc networks , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[28]  Nathan Linial,et al.  Distributive graph algorithms Global solutions from local data , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[29]  Roger Wattenhofer,et al.  A log-star distributed maximal independent set algorithm for growth-bounded graphs , 2008, PODC '08.

[30]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[31]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[32]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[33]  Richard Cole,et al.  Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..

[34]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

[35]  Esther Jennings,et al.  Distributed Algorithms for Finding Small Cycle Covers in Arbitrary Networks , 1994, ISAAC.

[36]  Subhash Suri,et al.  Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry , 2007, Int. J. Robotics Res..

[37]  Roger Wattenhofer,et al.  On the locality of bounded growth , 2005, PODC '05.

[38]  Roger Wattenhofer,et al.  Maximal independent sets in radio networks , 2005, PODC '05.

[39]  Andrew V. Goldberg,et al.  Network decomposition and locality in distributed computation , 1989, 30th Annual Symposium on Foundations of Computer Science.

[40]  Subhash Suri,et al.  Simple Robots in Polygonal Environments: A Hierarchy , 2008, ALGOSENSORS.

[41]  Yoav Shoham,et al.  Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.

[42]  M. Goresky,et al.  An Introduction to Abstract Algebra , 2005 .

[43]  Moni Naor,et al.  What can be computed locally? , 1993, STOC.

[44]  David Peleg,et al.  A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction , 2000, SIAM J. Comput..

[45]  Imran A. Pirwani,et al.  Energy conservation via domatic partitions , 2006, MobiHoc '06.

[46]  Harold Abelson,et al.  Corrigendum: Towards a Theory of Local and Global in Computation , 1978, Theoretical Computer Science.

[47]  Aravind Srinivasan,et al.  Improved distributed algorithms for coloring and network decomposition problems , 1992, STOC '92.

[48]  Shay Kutten,et al.  Fast distributed construction of k-dominating sets and applications , 1995, PODC '95.

[49]  Xiang-Yang Li,et al.  Applications of k-local MST for topology control and broadcasting in wireless ad hoc networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[50]  Steven M. LaValle,et al.  Bitbots: Simple Robots Solving Complex Tasks , 2005, AAAI.

[51]  Robert E. Tarjan,et al.  Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

[52]  Jean-Pierre Hubaux,et al.  COMMON-Sense Net: Improved Water Management for Resource-Poor Farmers via Sensor Networks , 2006, 2006 International Conference on Information and Communication Technologies and Development.

[53]  Y. Shoham,et al.  Truth revelation in rapid, approximately efficient combinatorial auctions , 2001 .

[54]  Leonidas J. Guibas,et al.  A Visibility-Based Pursuit-Evasion Problem , 1999, Int. J. Comput. Geom. Appl..

[55]  P. Pardalos,et al.  Handbook of Combinatorial Optimization , 1998 .

[56]  Bruce Randall Donald,et al.  On Information Invariants in Robotics , 1995, Artif. Intell..

[57]  Harold Abelson,et al.  Lower bounds on information transfer in distributed computations , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[58]  Roger Wattenhofer,et al.  Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs , 2005, DISC.

[59]  Ileana Streinu,et al.  The vertex-edge visibility graph of a polygon , 1998, Comput. Geom..

[60]  Berthold Vöcking,et al.  Approximation techniques for utilitarian mechanism design , 2005, STOC '05.

[61]  David Eppstein,et al.  Spanning Trees and Spanners , 2000, Handbook of Computational Geometry.

[62]  Seth Pettie,et al.  An optimal minimum spanning tree algorithm , 2000, JACM.

[63]  Alan Frieze,et al.  On the Length of the Longest Monotone Subsequence in a Random Permutation , 1991 .

[64]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[65]  Noam Nisan,et al.  Algorithmic mechanism design (extended abstract) , 1999, STOC '99.

[66]  Jason M. O'Kane,et al.  Dominance and Equivalence for Sensor-Based Agents , 2007, AAAI.

[67]  Beat Gfeller,et al.  A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs , 2007, Ad Hoc Sens. Wirel. Networks.

[68]  Harald Niederreiter,et al.  Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..

[69]  H. Moulin,et al.  Strategyproof sharing of submodular costs:budget balance versus efficiency , 2001 .

[70]  B. Logan,et al.  A Variational Problem for Random Young Tableaux , 1977 .

[71]  Joan Feigenbaum,et al.  Hardness Results for Multicast Cost Sharing , 2002, FSTTCS.

[72]  Valmir Carneiro Barbosa,et al.  A distributed algorithm to find k-dominating sets , 2004, Discret. Appl. Math..

[73]  I. Shafarevich.  Basic algebraic geometry , 1974 .

[74]  Shantanu Das,et al.  Rendezvous of Mobile Agents When Tokens Fail Anytime , 2008, OPODIS.

[75]  Uriel Feige.  A threshold of ln n for approximating set cover (preliminary version) , 1996, STOC '96.

[76]  Stefan Schmid,et al.  Algorithmic models for sensor networks , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[77]  Oscar Zariski,et al.  A new proof of Hilbert’s Nullstellensatz , 1947 .

[78]  Joan Feigenbaum,et al.  Sharing the Cost of Multicast Transmissions , 2001, J. Comput. Syst. Sci..

[79]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[80]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[81]  Subhash Suri,et al.  Counting Targets with Mobile Sensors in an Unknown Environment , 2007, ALGOSENSORS.

[82]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[83]  Harry B. Hunt,et al.  NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs , 1998, J. Algorithms.

[84]  Bernard Chazelle,et al.  A minimum spanning tree algorithm with inverse-Ackermann type complexity , 2000, JACM.

[85]  Steven M. LaValle,et al.  Using a Robot to Learn Geometric Information from Permutations of Landmarks , 2006 .

[86]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[87]  Roger Wattenhofer,et al.  Fault-Tolerant Clustering in Ad Hoc and Sensor Networks , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[88]  Steve Fisk,et al.  A short proof of Chvátal's Watchman Theorem , 1978, J. Comb. Theory, Ser. B.

[89]  Thomas Lickteig,et al.  Test complexity of generic polynomials , 1992, J. Complex..

[90]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

[91]  Roger Wattenhofer,et al.  Local approximation schemes for ad hoc and sensor networks , 2005, DIALM-POMC '05.

[92]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[93]  Aravind Srinivasan,et al.  Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons , 2003, J. Comput. Syst. Sci..

[94]  Baruch Awerbuch,et al.  Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.

[95]  Noga Alon,et al.  The Moore Bound for Irregular Graphs , 2002, Graphs Comb..

[96]  Jerry R. Green,et al.  Incentives in public decision-making , 1979 .

[97]  Deying Li,et al.  A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks , 2003, Networks.

[98]  Xiang-Yang Li,et al.  Distributed low-cost backbone formation for wireless ad hoc networks , 2005, MobiHoc '05.

[99]  Beat Gfeller,et al.  A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs , 2007, PODC '07.

[100]  Juraj Hromkovic,et al.  Communication Complexity and Parallel Computing , 1997, Texts in Theoretical Computer Science An EATCS Series.

[101]  John N. Tsitsiklis,et al.  On the communication complexity of distributed algebraic computation , 1993, JACM.

[102]  Petr A. Golovach,et al.  How to guard a graph , 2008 .

[103]  Subhash Suri,et al.  Angle Optimization in Target Tracking , 2008, Scandinavian Workshop on Algorithm Theory.

[104]  Stephen E. Deering,et al.  Multicast routing in datagram internetworks and extended LANs , 1990, TOCS.

[105]  Rajiv Gandhi,et al.  Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks , 2004, FSTTCS.

[106]  Michael Clausen,et al.  Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.

[107]  T. Nieberg,et al.  Wireless communication graphs , 2004, Proceedings of the 2004 Intelligent Sensors, Sensor Networks and Information Processing Conference, 2004..

[108]  Srikanth V. Krishnamurthy,et al.  Topology Control to Simultaneously Achieve Near-Optimal Node Degree and Low Path Stretch in Ad hoc Networks , 2006, 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks.