Zobrazeno 1 - 10
of 217
pro vyhledávání: '"Jens Vygen"'
Autor:
Vera Traub, Jens Vygen
Publikováno v:
SIAM Journal on Computing. 51:139-173
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dedababdd765fd98db123cd2269d8784
https://doi.org/10.1137/1.9781611977554.ch79
https://doi.org/10.1137/1.9781611977554.ch79
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783031069000
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::081dce8b4795adf1a579e6fa8b938f38
https://doi.org/10.1007/978-3-031-06901-7_2
https://doi.org/10.1007/978-3-031-06901-7_2
Publikováno v:
Mathematical Programming. 183:379-395
We show that the classical LP relaxation of the asymmetric traveling salesman path problem (ATSPP) has constant integrality ratio. If $\rho_{\text{ATSP}}$ and $\rho_{\text{ATSPP}}$ denote the integrality ratios for the asymmetric TSP and its path ver
Publikováno v:
Discrete Optimization. 33:87-100
When delivering items to a set of destinations, one can save time and cost by passing a subset to a sub-contractor at any point en route. We consider a model where a set of items are initially loaded in one vehicle and should be distributed before a
Autor:
Jens Vygen, Vera Traub
Publikováno v:
Operations Research Letters. 47:225-228
We give an improved analysis of the best-of-many Christofides algorithm with lonely edge deletion, which was proposed by Sebő and van Zuylen (2016). This implies an improved upper bound on the integrality ratio of the standard LP relaxation for the
Autor:
Jens Vygen, Vera Traub
Publikováno v:
Journal of the ACM. 66:1-17
We show that there is a polynomial-time algorithm with approximation guarantee 3/2+ε for the s - t -path TSP, for any fixed ε > 0. It is well-known that Wolsey’s analysis of Christofide algorithm also works for the s - t -path TSP with its natura
Publikováno v:
ACM Transactions on Design Automation of Electronic Systems. 23:1-16
We present a primal-dual approximation algorithm for minimizing the leakage power of an integrated circuit by assigning gate threshold voltages. While most existing techniques do not provide a performance guarantee, we prove an upper bound on the pow
Publikováno v:
SIAM Journal on Discrete Mathematics
SIAM Journal on Discrete Mathematics, 2021, 35 (2), pp.752-769. ⟨10.1137/20M1319401⟩
SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2021, 35 (2), pp.752-769. ⟨10.1137/20M1319401⟩
SIAM Journal on Discrete Mathematics, 2021, 35 (2), pp.752-769. ⟨10.1137/20M1319401⟩
SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2021, 35 (2), pp.752-769. ⟨10.1137/20M1319401⟩
International audience; We devise a constant-factor approximation algorithm for the maximization version of the edge-disjoint paths problem if the supply graph together with the demand edges form a planar graph. By planar duality this is equivalent t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b39abe85a4d30b0ffe66488a3d812d6a
https://hal.archives-ouvertes.fr/hal-03099892/document
https://hal.archives-ouvertes.fr/hal-03099892/document
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783030738785
IPCO
IPCO
We revisit the deadline version of the discrete time-cost tradeoff problem for the special case of bounded depth. Such instances occur for example in VLSI design. The depth of an instance is the number of jobs in a longest chain and is denoted by d.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e1fd6639b6dcb55260740ebdc295de30
https://doi.org/10.1007/978-3-030-73879-2_3
https://doi.org/10.1007/978-3-030-73879-2_3