Zobrazeno 1 - 10
of 510
pro vyhledávání: '"A. Kortsarz"'
We consider minimum time multicasting problems in directed and undirected graphs: given a root node and a subset of $t$ terminal nodes, multicasting seeks to find the minimum number of rounds within which all terminals can be informed with a message
Externí odkaz:
http://arxiv.org/abs/2410.01048
Motivated by applications in production planning and storage allocation in hierarchical databases, we initiate the study of covering partially ordered items (CPO). Given a capacity $k \in \mathbb{Z}^+$, and a directed graph $G=(V,E)$ where each verte
Externí odkaz:
http://arxiv.org/abs/2403.01568
One of the most important and well-studied settings for network design is edge-connectivity requirements. This encompasses uniform demands such as the Minimum $k$-Edge-Connected Spanning Subgraph problem as well as nonuniform demands such as the Surv
Externí odkaz:
http://arxiv.org/abs/2304.06656
While much of network design focuses mostly on cost (number or weight of edges), node degrees have also played an important role. They have traditionally either appeared as an objective, to minimize the maximum degree (e.g., the Minimum Degree Spanni
Externí odkaz:
http://arxiv.org/abs/2302.11475
One of the most important and well-studied settings for network design is edge-connectivity requirements. This encompasses uniform demands such as the Minimum $k$-Edge-Connected Spanning Subgraph problem ($k$-ECSS), as well as nonuniform demands such
Externí odkaz:
http://arxiv.org/abs/2206.12245
We show that Set Cover on instances with $N$ elements cannot be approximated within $(1-\gamma)\ln N$-factor in time exp($N^{\gamma-\delta})$, for any $0 < \gamma < 1$ and any $\delta > 0$, assuming the Exponential Time Hypothesis. This essentially m
Externí odkaz:
http://arxiv.org/abs/2008.05374
Autor:
Kortsarz, Guy, Nutov, Zeev
We study two problems that seek a subtree $T$ of a graph $G=(V,E)$ such that $T$ satisfies a certain property and has minimal maximum degree. - In the Min-Degree Group Steiner Tree problem we are given a collection ${\cal S}$ of groups (subsets of $V
Externí odkaz:
http://arxiv.org/abs/1910.12848
Directed Steiner Tree (DST) is a central problem in combinatorial optimization and theoretical computer science: Given a directed graph $G=(V, E)$ with edge costs $c \in \mathbb{R}_{\geq 0}^E$, a root $r \in V$ and $k$ terminals $K\subseteq V$, we ne
Externí odkaz:
http://arxiv.org/abs/1907.11404
This paper concerns proving almost tight (super-polynomial) running times, for achieving desired approximation ratios for various problems. To illustrate, the question we study, let us consider the Set-Cover problem with n elements and m sets. Now we
Externí odkaz:
http://arxiv.org/abs/1811.00710
We introduce the problem of finding a spanning tree along with a partition of the tree edges into fewest number of feasible sets, where constraints on the edges define feasibility. The motivation comes from wireless networking, where we seek to model
Externí odkaz:
http://arxiv.org/abs/1803.04578