Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Vivek Madan"'
We consider the capacitated $$k$$ k -center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) $$k$$ k locations (called ce
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::61c9e72a859e3c9cd77ed881f33a59e1
http://doc.rero.ch/record/332124/files/10107_2014_Article_857.pdf
http://doc.rero.ch/record/332124/files/10107_2014_Article_857.pdf
Publikováno v:
Mathematical Programming. 184:411-443
We investigate the approximability of the linear 3-cut problem in directed graphs. The input here is a directed graph $$D=(V,E)$$ with node weights and three specified terminal nodes $$s,r,t\in V$$ , and the goal is to find a minimum weight subset of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::299b7e99512eb43ddf71ee18908a113f
https://doi.org/10.1007/s10107-019-01417-9
https://doi.org/10.1007/s10107-019-01417-9
Publikováno v:
Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aaab6006ccd6a125fe58fa57ea32714f
https://doi.org/10.18653/v1/2021.emnlp-main.463
https://doi.org/10.18653/v1/2021.emnlp-main.463
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783030179526
IPCO
IPCO
In the multiway cut problem, we are given an undirected graph with non-negative edge weights and a collection of k terminal nodes, and the goal is to partition the node set of the graph into k non-empty parts each containing exactly one terminal so t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7fc22da0f28f6c5578e8433a3f94cb73
http://hdl.handle.net/10831/49105
http://hdl.handle.net/10831/49105
In the multiway cut problem, we are given an undirected graph with non-negative edge weights and a collection of $k$ terminal nodes, and the goal is to partition the node set of the graph into $k$ non-empty parts each containing exactly one terminal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aebc5e9b0a8e9d446932eed2c6b582a8
http://arxiv.org/abs/1807.09735
http://arxiv.org/abs/1807.09735
Autor:
Chandra Chekuri, Vivek Madan
In the minimum Multicut problem, the input is an edge-weighted supply graph $G=(V,E)$ and a simple demand graph $H=(V,F)$. Either $G$ and $H$ are directed (DMulC) or both are undirected (UMulC). The goal is to remove a minimum weight set of edges in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3eed4910b67be7d3334a40dfa18b6e43
http://arxiv.org/abs/1607.07200
http://arxiv.org/abs/1607.07200
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783319075563
IPCO
IPCO
We consider the capacitated k-center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) k locations (called centers) and as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c1b945e53f124e88b41be9eeb777164
https://doi.org/10.1007/978-3-319-07557-0_5
https://doi.org/10.1007/978-3-319-07557-0_5
A $k$-lift of an $n$-vertex base graph $G$ is a graph $H$ on $n\times k$ vertices, where each vertex $v$ of $G$ is replaced by $k$ vertices $v_1,\cdots{},v_k$ and each edge $(u,v)$ in $G$ is replaced by a matching representing a bijection $\pi_{uv}$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b3f9c5a341633868effb7e00069f7029
http://arxiv.org/abs/1311.3268
http://arxiv.org/abs/1311.3268
Publikováno v:
Logic, Language, Information and Computation ISBN: 9783642326202
WoLLIC
WoLLIC
We investigate a model-theoretic property that generalizes the classical notion of preservation under substructures. We call this property preservation under substructures modulo bounded cores, and present a syntactic characterization via \(\Sigma_2^
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9c299c77b30bdf6c47b27bd68cca036
https://doi.org/10.1007/978-3-642-32621-9_22
https://doi.org/10.1007/978-3-642-32621-9_22