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-articleMarch 2024
- research-articleOctober 2023
Minimum+1 (s, t)-cuts and Dual-edge Sensitivity Oracle
ACM Transactions on Algorithms (TALG), Volume 19, Issue 4Article No.: 38, Pages 1–41https://doi.org/10.1145/3623271Let G be a directed multi-graph on n vertices and m edges with a designated source vertex s and a designated sink vertex t. We study the (s,t)-cuts of capacity minimum+1 and as an important application of them, we give a solution to the dual-edge ...
- research-articleJanuary 2022
Max Flows in Planar Graphs with Vertex Capacities
ACM Transactions on Algorithms (TALG), Volume 18, Issue 1Article No.: 9, Pages 1–27https://doi.org/10.1145/3504032We consider the maximum flow problem in directed planar graphs with capacities on both vertices and arcs and with multiple sources and sinks. We present three algorithms when the capacities are integers. The first algorithm runs in O(min {k2 n, n log3 n + ...
- research-articleNovember 2018
The Simplex Algorithm Is NP-Mighty
ACM Transactions on Algorithms (TALG), Volume 15, Issue 1Article No.: 5, Pages 1–19https://doi.org/10.1145/3280847We show that the Simplex Method, the Network Simplex Method—both with Dantzig’s original pivot rule—and the Successive Shortest Path Algorithm are NP-mighty. That is, each of these algorithms can be used to solve, with polynomial overhead, any problem ...
- research-articleAugust 2018
Conditional Lower Bounds for All-Pairs Max-Flow
ACM Transactions on Algorithms (TALG), Volume 14, Issue 4Article No.: 42, Pages 1–15https://doi.org/10.1145/3212510We provide evidence that computing the maximum flow value between every pair of nodes in a directed graph on n nodes, m edges, and capacities in the range [1‥n], which we call the All-Pairs Max-Flow problem, cannot be solved in time that is significantly ...
-
- research-articleDecember 2017
Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks
ACM Transactions on Algorithms (TALG), Volume 13, Issue 4Article No.: 51, Pages 1–24https://doi.org/10.1145/3146550We study the problem of maintaining a breadth-first spanning tree (BFS tree) in partially dynamic distributed networks modeling a sequence of either failures or additions of communication links (but not both). We present deterministic (1+ϵ)-...
- research-articleApril 2015
A Bounded Budget Network Creation Game
- Shayan Ehsani,
- Saber Shokat Fadaee,
- Mohammadamin Fazli,
- Abbas Mehrabian,
- Sina Sadeghian Sadeghabad,
- Mohammadali Safari,
- Morteza Saghafian
ACM Transactions on Algorithms (TALG), Volume 11, Issue 4Article No.: 34, Pages 1–25https://doi.org/10.1145/2701615We introduce a network creation game in which each player (vertex) has a fixed budget to establish links to other players. In this model, each link has a unit price, and each agent tries to minimize its cost, which is either its eccentricity or its ...
- research-articleMay 2014
Fast Convergence for Consensus in Dynamic Networks
ACM Transactions on Algorithms (TALG), Volume 10, Issue 3Article No.: 15, Pages 1–15https://doi.org/10.1145/2601072In this article, we study the convergence time required to achieve consensus in dynamic networks. In each timestep, a node's value is updated to some weighted average of its neighbors and its old values. We study the case when the underlying network is ...
- research-articleJuly 2012
Improved algorithms for orienteering and related problems
ACM Transactions on Algorithms (TALG), Volume 8, Issue 3Article No.: 23, Pages 1–27https://doi.org/10.1145/2229163.2229167In this article, we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering problem is the following: Given an edge-weighted graph G=(V, E) (directed or undirected)...
- research-articleApril 2012
The price of anarchy in network creation games
ACM Transactions on Algorithms (TALG), Volume 8, Issue 2Article No.: 13, Pages 1–13https://doi.org/10.1145/2151171.2151176We study Nash equilibria in the setting of network creation games introduced recently by Fabrikant, Luthra, Maneva, Papadimitriou, and Shenker. In this game we have a set of selfish node players, each creating some incident links, and the goal is to ...
- research-articleSeptember 2011
Fast computation of small cuts via cycle space sampling
ACM Transactions on Algorithms (TALG), Volume 7, Issue 4Article No.: 46, Pages 1–30https://doi.org/10.1145/2000807.2000814We describe a new sampling-based method to determine cuts in an undirected graph. For a graph (V, E), its cycle space is the family of all subsets of E that have even degree at each vertex. We prove that with high probability, sampling the cycle space ...
- research-articleJuly 2011
Minimizing flow time in the wireless gathering problem
ACM Transactions on Algorithms (TALG), Volume 7, Issue 3Article No.: 33, Pages 1–20https://doi.org/10.1145/1978782.1978788We address the problem of efficient data gathering in a wireless network through multihop communication. We focus on two objectives related to flow times, that is, the times spent by data packets in the system: minimization of the maximum flow time and ...
- research-articleJuly 2011
Rate vs. buffer size--greedy information gathering on the line
ACM Transactions on Algorithms (TALG), Volume 7, Issue 3Article No.: 32, Pages 1–22https://doi.org/10.1145/1978782.1978787We consider packet networks with limited buffer space at the nodes, and are interested in the question of maximizing the number of packets that arrive to destination rather than being dropped due to full buffers.
We initiate a more refined analysis of ...
- research-articleMarch 2011
Shortest vertex-disjoint two-face paths in planar graphs
ACM Transactions on Algorithms (TALG), Volume 7, Issue 2Article No.: 19, Pages 1–12https://doi.org/10.1145/1921659.1921665Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G let s1,…,sk be vertices incident with s let t1,…,tk be vertices incident with t. We give an algorithm to compute k pairwise ...
- research-articleMarch 2011
Tree exploration with logarithmic memory
ACM Transactions on Algorithms (TALG), Volume 7, Issue 2Article No.: 17, Pages 1–21https://doi.org/10.1145/1921659.1921663We consider the task of network exploration by a mobile agent (robot) with small memory. The agent has to traverse all nodes and edges of a network (represented as an undirected connected graph), and return to the starting node. Nodes of the network are ...
- research-articleDecember 2010
Length-bounded cuts and flows
- Georg Baier,
- Thomas Erlebach,
- Alexander Hall,
- Ekkehard Köhler,
- Petr Kolman,
- Ondřej Pangrác,
- Heiko Schilling,
- Martin Skutella
ACM Transactions on Algorithms (TALG), Volume 7, Issue 1Article No.: 4, Pages 1–27https://doi.org/10.1145/1868237.1868241For a given number L, an L-length-bounded edge-cut (node-cut, respectively) in a graph G with source s and sink t is a set C of edges (nodes, respectively) such that no s-t-path of length at most L remains in the graph after removing the edges (nodes, ...
- research-articleJuly 2010
Competitive weighted throughput analysis of greedy protocols on DAGs
ACM Transactions on Algorithms (TALG), Volume 6, Issue 3Article No.: 50, Pages 1–22https://doi.org/10.1145/1798596.1798603The combination of the buffer sizes of routers deployed in the Internet, and the Internet traffic itself, leads routinely to the dropping of packets. Motivated by this, we are interested in the problem of maximizing the throughput of protocols that ...
- research-articleDecember 2009
Simultaneous source location
ACM Transactions on Algorithms (TALG), Volume 6, Issue 1Article No.: 16, Pages 1–17https://doi.org/10.1145/1644015.1644031We consider the problem of simultaneous source location: selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied simultaneously, with the goal of minimizing the number of locations chosen. For general ...
- research-articleDecember 2009
Latency-constrained aggregation in sensor networks
- LUCA Becchetti,
- Alberto Marchetti-Spaccamela,
- Andrea Vitaletti,
- Peter Korteweg,
- Martin Skutella,
- Leen Stougie
ACM Transactions on Algorithms (TALG), Volume 6, Issue 1Article No.: 13, Pages 1–20https://doi.org/10.1145/1644015.1644028A sensor network consists of sensing devices which may exchange data through wireless communication; sensor networks are highly energy constrained since they are usually battery operated. Data aggregation is a possible way to save energy consumption: ...
- research-articleJuly 2009
Compacting cuts: A new linear formulation for minimum cut
ACM Transactions on Algorithms (TALG), Volume 5, Issue 3Article No.: 27, Pages 1–16https://doi.org/10.1145/1541885.1541888For a graph (V,E), existing compact linear formulations for the minimum cut problem require Θ(|V||E|) variables and constraints and can be interpreted as a composition of |V| − 1 polyhedra for minimum s-t cuts in much the same way as early approaches to ...