Issue Downloads
2-Approximating Feedback Vertex Set in Tournaments
A tournament is a directed graph T such that every pair of vertices is connected by an arc. A feedback vertex set is a set S of vertices in T such that T − S is acyclic. We consider the Feedback Vertex Set problem in tournaments. Here, the input is a ...
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
The Directed Steiner Network (DSN) problem takes as input a directed graph G=(V, E) with non-negative edge-weights and a set D⊆ V × V of k demand pairs. The aim is to compute the cheapest network N⊆ G for which there is an s\rightarrow t path for each (...
Finding a Shortest Odd Hole
An 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,...
Node-weighted Network Design in Planar and Minor-closed Families of Graphs
We consider node-weighted survivable network design (SNDP) in planar graphs and minor-closed families of graphs. The input consists of a node-weighted undirected graph G = (V, E) and integer connectivity requirements r(uv) for each unordered pair of ...
Navigating in Trees with Permanently Noisy Advice
We consider a search problem on trees in which an agent starts at the root of a tree and aims to locate an adversarially placed treasure, by moving along the edges, while relying on local, partial information. Specifically, each node in the tree holds a ...
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
The Massively Parallel Computation (MPC) model is an emerging model that distills core aspects of distributed and parallel computation, developed as a tool to solve combinatorial (typically graph) problems in systems of many machines with limited space.
...Sparse Backbone and Optimal Distributed SINR Algorithms
We 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 ...
Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls
We consider space-bounded computations on a random-access machine, where the input is given on a read-only random-access medium, the output is to be produced to a write-only sequential-access medium, and the available workspace allows random reads and ...
