Zobrazeno 1 - 7
of 7
pro vyhledávání: '"KORTSARZ, GUY"'
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::abb681c8503b106e4c72eb7886cf446d
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dfb537f8bb2a11f18267167f6c70ef1f
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 as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c1ecf716344c02ce8b614c1f5535522
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5671e2882cae85187abffb047a9bcf89
Autor:
Kortsarz, Guy, Nutov, Zeev
Publikováno v:
Combinatorial Algorithms
Motivated by some open problems posed in [13], we study three problems that seek a low degree subtree T of a graph \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy}
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c08f2f05183cb1ddd11396e3de8ae1f
Autor:
Esfandiari, Hossein, Kortsarz, Guy
In this paper we consider the pairwise kidney exchange game. This game naturally appears in situations that some service providers benefit from pairwise allocations on a network, such as the kidney exchanges between hospitals. Ashlagi et al. present
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5974610bef616c76d83933c6f6d3178d
A Fixed-Parameter Tractable (\FPT) $\rho$-approximation algorithm for a minimization (resp. maximization) parameterized problem $P$ is an FPT algorithm that, given an instance $(x, k)\in P$ computes a solution of cost at most $k \cdot \rho(k)$ (resp.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a3644bd61df4ffd92ece2d9368a5069