Search Results

Documents authored by Chaturvedi, Anya

Document
DOI: 10.4230/LIPIcs.SAND.2026.13
Online Algorithms for Set Packing with Renewable Capacities

Authors: Anya Chaturvedi, William K. Moses Jr., Christian Scheideler, and Prudence W. H. Wong

Published in: LIPIcs, Volume 373, 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)

Abstract
We propose and study a new extension of the classical set packing problem, which we call the online D-set packing with renewable capacities (D-SPaRC) problem. In the D-SPaRC setting, there is a collection of resources with associated capacities. Requests arrive one by one, and for each request, a decision has to be made to accept it or not before seeing future requests. Each request is associated with a collection of subsets of resources, with each subset having cardinality at most D. When accepting a request, exactly one of these subsets must be chosen, which consumes one unit of capacity on each of the involved resources. Over time, the available resource capacities may be renewed, allowing additional requests to be accepted. Many online problems, including packing, routing, and scheduling, can be formulated as a D-SPaRC problem, thus underlining its usefulness. We first present a simple greedy algorithm that is O(ĉ_min ⋅ (D^{1/ĉ_min}-1))-competitive for D ≥ 2 and 3-competitive if D = 1, where ĉ_min is the minimum capacity of the resources. We then show that, for ĉ_min = Ω(log D), the greedy algorithm can be extended to an online algorithm with predictions whose competitive ratio is never worse than that of the original greedy approach and can, in fact, be reduced to a constant when the predictions are optimal. Finally, we generalize the D-SPaRC problem in two meaningful ways, namely by addressing non-uniform request priorities and by handling requests with non-uniform weights.
Cite as

Anya Chaturvedi, William K. Moses Jr., Christian Scheideler, and Prudence W. H. Wong. Online Algorithms for Set Packing with Renewable Capacities. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 13:1-13:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{chaturvedi_et_al:LIPIcs.SAND.2026.13,
  author =	{Chaturvedi, Anya and Moses Jr., William K. and Scheideler, Christian and Wong, Prudence W. H.},
  title =	{{Online Algorithms for Set Packing with Renewable Capacities}},
  booktitle =	{5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
  pages =	{13:1--13:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-427-7},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{373},
  editor =	{Mertzios, George B. and Richa, Andr\'{e}a W.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.13},
  URN =		{urn:nbn:de:0030-drops-262472},
  doi =		{10.4230/LIPIcs.SAND.2026.13},
  annote =	{Keywords: Set packing, online algorithms, learning-augmented algorithms}
}
Document
Brief Announcement
DOI: 10.4230/LIPIcs.DISC.2025.49
Brief Announcement: Synchronization in Anonymous Networks Under Arbitrary Dynamics

Authors: Rida Bazzi, Anya Chaturvedi, Andréa W. Richa, and Peter Vargas

Published in: LIPIcs, Volume 356, 39th International Symposium on Distributed Computing (DISC 2025)

Abstract
We present the δ-Synchronizer, which works in non-synchronous dynamic networks under minimal assumptions. Our model allows for arbitrary topological changes without any guarantee of eventual global or partial stabilization and assumes that nodes are anonymous. This deterministic synchronizer is the first that enables nodes to simulate a dynamic network synchronous algorithm for executions in a semi-synchronous dynamic environment under a weakly-fair node activation scheduler, despite the absence of a global clock, node ids, persistent connectivity or any assumptions about the edge dynamics (in both the synchronous and semi-synchronous environments). We make the following contributions: (1) we extend the definition of synchronizers to networks with arbitrary edge dynamics; (2) we present the first synchronizer from the semi-synchronous to the synchronous model in such networks; and (3) we present non-trivial applications of the proposed synchronizer to existing algorithms. We assume an extension of the Pull communication model by adding a single 1-bit multi-writer atomic register at each edge-port of a node. We show that this extension is needed and that synchronization in our setting is not possible without it. The δ-Synchronizer operates with memory overhead at the nodes that is asymptotically logarithmic on the runtime of the underlying synchronous algorithm being simulated - in particular, it is logarithmic for polynomial-time synchronous algorithms.
Cite as

Rida Bazzi, Anya Chaturvedi, Andréa W. Richa, and Peter Vargas. Brief Announcement: Synchronization in Anonymous Networks Under Arbitrary Dynamics. In 39th International Symposium on Distributed Computing (DISC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 356, pp. 49:1-49:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{bazzi_et_al:LIPIcs.DISC.2025.49,
  author =	{Bazzi, Rida and Chaturvedi, Anya and Richa, Andr\'{e}a W. and Vargas, Peter},
  title =	{{Brief Announcement: Synchronization in Anonymous Networks Under Arbitrary Dynamics}},
  booktitle =	{39th International Symposium on Distributed Computing (DISC 2025)},
  pages =	{49:1--49:8},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-402-4},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{356},
  editor =	{Kowalski, Dariusz R.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2025.49},
  URN =		{urn:nbn:de:0030-drops-248652},
  doi =		{10.4230/LIPIcs.DISC.2025.49},
  annote =	{Keywords: Synchronization, Anonymous Dynamic Networks, Arbitrary Dynamics}
}
Document
DOI: 10.4230/LIPIcs.SAND.2025.15
On the Runtime of Local Mutual Exclusion for Anonymous Dynamic Networks

Authors: Anya Chaturvedi, Joshua J. Daymude, and Andréa W. Richa

Published in: LIPIcs, Volume 330, 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)

Abstract
Algorithms for mutual exclusion aim to isolate potentially concurrent accesses to the same shared resources. Motivated by distributed computing research on programmable matter and population protocols where interactions among entities are often assumed to be isolated, Daymude, Richa, and Scheideler (SAND`22) introduced a variant of the local mutual exclusion problem that applies to arbitrary dynamic networks: each node, on issuing a lock request, must acquire exclusive locks on itself and all its persistent neighbors, i.e., the neighbors that remain connected to it over the duration of the lock request. Assuming adversarial edge dynamics, semi-synchronous or asynchronous concurrency, and anonymous nodes communicating via message passing, their randomized algorithm achieves mutual exclusion (non-intersecting lock sets) and lockout freedom (eventual success with probability 1). However, they did not analyze their algorithm’s runtime. In this paper, we prove that any node will successfully lock itself and its persistent neighbors within 𝒪(nΔ³) open rounds of its lock request in expectation, where n is the number of nodes in the dynamic network, Δ is the maximum degree of the dynamic network, rounds are normalized to the execution time of the "slowest" node, and "closed" rounds when some persistent neighbors are already locked by another node are ignored (i.e., only "open" rounds are considered).
Cite as

Anya Chaturvedi, Joshua J. Daymude, and Andréa W. Richa. On the Runtime of Local Mutual Exclusion for Anonymous Dynamic Networks. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 15:1-15:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{chaturvedi_et_al:LIPIcs.SAND.2025.15,
  author =	{Chaturvedi, Anya and Daymude, Joshua J. and Richa, Andr\'{e}a W.},
  title =	{{On the Runtime of Local Mutual Exclusion for Anonymous Dynamic Networks}},
  booktitle =	{4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)},
  pages =	{15:1--15:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-368-3},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{330},
  editor =	{Meeks, Kitty and Scheideler, Christian},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.15},
  URN =		{urn:nbn:de:0030-drops-230687},
  doi =		{10.4230/LIPIcs.SAND.2025.15},
  annote =	{Keywords: Mutual exclusion, dynamic networks, message passing, concurrency}
}
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact