Maximum 0-1 Timed Matching on Temporal Graphs

Subhrangsu Mandal; Arobinda Gupta

Home/Archive/arXiv

arXiv · 2012.08909

Maximum 0-1 Timed Matching on Temporal Graphs

Subhrangsu Mandal·Arobinda Gupta

View original source ↗Read source document ↗Export metadata ↓

Abstract

Temporal graphs are graphs where the topology and/or other properties of the graph change with time. They have been used to model applications with temporal information in various domains. Problems on static graphs become more challenging to solve in temporal graphs because of dynamically changing topology, and many recent works have explored graph problems on temporal graphs. In this paper, we define a type of matching called {\em 0-1 timed matching} for temporal graphs, and investigate the problem of finding a {\em maximum 0-1 timed matching} for different classes of temporal graphs. We first prove that the problem is NP-Complete for rooted temporal trees when each edge is associated with two or more time intervals. We then propose an $O(n \log n)$ time algorithm for the problem on a rooted temporal tree with $n$ nodes when each edge is associated with exactly one time interval. The problem is then shown to be NP-Complete also for bipartite temporal graphs even when each edge is associated with a single time interval and degree of each node is bounded by a constant $k \geq 3$. We next investigate approximation algorithms for the problem for temporal graphs where each edge is associated with more than one time intervals. It is first shown that there is no $\frac{1}{n^{1-\epsilon}}$-factor approximation algorithm for the problem for any $\epsilon > 0$ even on a rooted temporal tree with $n$ nodes unless NP = ZPP. We then present a $\frac{5}{2\mathcal{N}^* + 3}$-factor approximation algorithm for the problem for general temporal graphs where $\mathcal{N^*}$ is the average number of edges overlapping in time with each edge in the temporal graph. The same algorithm is also a constant-factor approximation algorithm for degree bounded temporal graphs.

Explore related subjects

cs.DS

Keep this discovery

BibTeX RIS

Subhrangsu Mandal, Arobinda Gupta. 2020-12-16. Maximum 0-1 Timed Matching on Temporal Graphs. https://arxiv.org/abs/2012.08909

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗