Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2021
Sparse Backbone and Optimal Distributed SINR Algorithms
ACM Transactions on Algorithms (TALG), Volume 17, Issue 2Article No.: 17, Pages 1–34https://doi.org/10.1145/3452937We develop randomized distributed algorithms for many of the most fundamental communication problems in wireless networks under the Signal to Interference and Noise Ratio (SINR) model of communication, including (multi-message) broadcast, local ...
- research-articleApril 2021
Finding a Shortest Odd Hole
ACM Transactions on Algorithms (TALG), Volume 17, Issue 2Article No.: 13, Pages 1–21https://doi.org/10.1145/3447869An odd hole in a graph is an induced cycle with odd length greater than 3. In an earlier paper (with Sophie Spirkl), solving a longstanding open problem, we gave a polynomial-time algorithm to test if a graph has an odd hole. We subsequently showed that,...
- research-articleJune 2020
Parameterized Hardness of Art Gallery Problems
ACM Transactions on Algorithms (TALG), Volume 16, Issue 4Article No.: 42, Pages 1–23https://doi.org/10.1145/3398684Given a simple polygon P on n vertices, two points x, y in P are said to be visible to each other if the line segment between x and y is contained in P. The Point Guard Art Gallery problem asks for a minimum set S such that every point in P is visible ...
- research-articleJune 2020
Clustering in Hypergraphs to Minimize Average Edge Service Time
ACM Transactions on Algorithms (TALG), Volume 16, Issue 3Article No.: 40, Pages 1–28https://doi.org/10.1145/3386121We study the problem of clustering the vertices of a weighted hypergraph such that on average the vertices of each edge can be covered by a small number of clusters. This problem has many applications, such as for designing medical tests, clustering ...
- research-articleAugust 2018
Batched Point Location in SINR Diagrams via Algebraic Tools
ACM Transactions on Algorithms (TALG), Volume 14, Issue 4Article No.: 41, Pages 1–29https://doi.org/10.1145/3209678The SINR (Signal to Interference plus Noise Ratio) model for the quality of wireless connections has been the subject of extensive recent study. It attempts to predict whether a particular transmitter is heard at a specific location, in a setting ...
-
- research-articleAugust 2018
Graph Reconstruction and Verification
ACM Transactions on Algorithms (TALG), Volume 14, Issue 4Article No.: 40, Pages 1–30https://doi.org/10.1145/3199606How efficiently can we find an unknown graph using distance or shortest path queries between its vertices? We assume that the unknown graph G is connected, unweighted, and has bounded degree. In the reconstruction problem, the goal is to find the graph G...
- research-articleMay 2018
Distributed Online and Stochastic Queueing on a Multiple Access Channel
ACM Transactions on Algorithms (TALG), Volume 14, Issue 2Article No.: 21, Pages 1–22https://doi.org/10.1145/3182396We consider the problems of online and stochastic packet queueing in a distributed system of n nodes with queues, where the communication between the nodes is done via a multiple access channel. In the online setting, in each round, an arbitrary number ...
- research-articleJanuary 2018
Fault-Tolerant Approximate BFS Structures
ACM Transactions on Algorithms (TALG), Volume 14, Issue 1Article No.: 10, Pages 1–15https://doi.org/10.1145/3022730A fault-tolerant structure for a network is required to continue functioning following the failure of some of the network’s edges or vertices. This article addresses the problem of designing a fault-tolerant (α , β) approximate BFS structure (or FT-ABFS ...
- research-articleOctober 2016
Sparse Fault-Tolerant BFS Structures
ACM Transactions on Algorithms (TALG), Volume 13, Issue 1Article No.: 11, Pages 1–24https://doi.org/10.1145/2976741A fault-tolerant structure for a network is required for continued functioning following the failure of some of the network’s edges or vertices. This article considers breadth-first search (BFS) spanning trees and addresses the problem of designing a ...
- research-articleJune 2016
Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension
ACM Transactions on Algorithms (TALG), Volume 12, Issue 3Article No.: 27, Pages 1–29https://doi.org/10.1145/2876055We consider compact routing schemes in networks of low doubling dimension, where the doubling dimension is the least value α such that any ball in the network can be covered by at most 2α balls of half radius. There are two variants of routing-scheme ...
- research-articleAugust 2014
Approximation Algorithms for Min-Max Generalization Problems
ACM Transactions on Algorithms (TALG), Volume 11, Issue 1Article No.: 5, Pages 1–23https://doi.org/10.1145/2636920We provide improved approximation algorithms for the min-max generalization problems considered by Du, Eppstein, Goodrich, and Lueker [Du et al. 2009]. Generalization is widely used in privacy-preserving data mining and can also be viewed as a natural ...
- research-articleAugust 2014
Principles of Robust Medium Access and an Application to Leader Election
ACM Transactions on Algorithms (TALG), Volume 10, Issue 4Article No.: 24, Pages 1–26https://doi.org/10.1145/2635818This article studies the design of medium access control (MAC) protocols for wireless networks that are provably robust against arbitrary and unpredictable disruptions (e.g., due to unintentional external interference from co-existing networks or due to ...
- research-articleAugust 2014
Distributed Selfish Load Balancing on Networks
ACM Transactions on Algorithms (TALG), Volume 11, Issue 1Article No.: 2, Pages 1–29https://doi.org/10.1145/2629671We study distributed load balancing in networks with selfish agents. In the simplest model considered here, there are n identical machines represented by vertices in a network and m > n selfish agents that unilaterally decide to move from one vertex to ...
- research-articleFebruary 2014
Price-based protocols for fair resource allocation: Convergence time analysis and extension to leontief utilities
ACM Transactions on Algorithms (TALG), Volume 10, Issue 2Article No.: 5, Pages 1–14https://doi.org/10.1145/2556949We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocation that is a logarithmic approximation, simultaneously, to all canonical ...
- research-articleDecember 2012
Cycle detection and correction
ACM Transactions on Algorithms (TALG), Volume 9, Issue 1Article No.: 13, Pages 1–20https://doi.org/10.1145/2390176.2390189Assume that a natural cyclic phenomenon has been measured, but the data is corrupted by errors. The type of corruption is application-dependent and may be caused by measurements errors, or natural features of the phenomenon. We assume that an ...
- research-articleDecember 2012
Combinatiorial algorithms for wireless information flow
ACM Transactions on Algorithms (TALG), Volume 9, Issue 1Article No.: 8, Pages 1–33https://doi.org/10.1145/2390176.2390184A long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel inherently ...
- research-articleDecember 2012
Wireless scheduling with power control
ACM Transactions on Algorithms (TALG), Volume 9, Issue 1Article No.: 7, Pages 1–20https://doi.org/10.1145/2390176.2390183We consider the scheduling of arbitrary wireless links in the physical model of interference to minimize the time for satisfying all requests. We study here the combined problem of scheduling and power control, where we seek both an assignment of power ...
- research-articleDecember 2012
A compact routing scheme and approximate distance oracle for power-law graphs
ACM Transactions on Algorithms (TALG), Volume 9, Issue 1Article No.: 4, Pages 1–26https://doi.org/10.1145/2390176.2390180Compact routing addresses the tradeoff between table sizes and stretch, which is the worst-case ratio between the length of the path a packet is routed through by the scheme and the length of an actual shortest path from source to destination. We adapt ...
- research-articleOctober 2012
The effectiveness of stackelberg strategies and tolls for network congestion games
ACM Transactions on Algorithms (TALG), Volume 8, Issue 4Article No.: 36, Pages 1–19https://doi.org/10.1145/2344422.2344426It is well known that in a network with arbitrary (convex) latency functions that are a function of edge traffic, the worst-case ratio, over all inputs, of the system delay caused due to selfish behavior versus the system delay of the optimal ...
- research-articleJuly 2012
Expansion properties of (secure) wireless networks
ACM Transactions on Algorithms (TALG), Volume 8, Issue 3Article No.: 21, Pages 1–9https://doi.org/10.1145/2229163.2229165We show that some topologies arising naturally in the context of wireless networking are low-degree, expander graphs.