Postulate
发表于 2025-3-25 05:16:27
https://doi.org/10.1007/978-3-642-90692-3re generalizations of the well-studied metric uncapacitated facility location problem, taking uncertainties in demand values and costs into account. The proposed nested local search procedure uses three facility operations: adding, dropping, and swapping. To the best of our knowledge, this is the fi
青春期
发表于 2025-3-25 08:11:30
http://reply.papertrans.cn/17/1605/160427/160427_22.png
法律的瑕疵
发表于 2025-3-25 14:44:51
https://doi.org/10.1007/978-3-642-94840-4neral graphs this problem is .-hard. In this paper we present an efficient polynomial time approximation scheme for the cluster editing problem on graphs embeddable in the plane with a few edge crossings. The running time of the algorithm is . for planar graphs and . for planar graphs with at most . crossings.
逢迎白雪
发表于 2025-3-25 17:57:24
F. Kraus,O. Minkowski,A. Schittenhelmgraphs. First, we show how to obtain a 2-quality flow sparsifier with . for such graphs. We then consider the other extreme and construct exact sparsifiers of size ., when the input graph is unweighted.
GEAR
发表于 2025-3-25 22:04:43
http://reply.papertrans.cn/17/1605/160427/160427_25.png
decipher
发表于 2025-3-26 03:03:03
http://reply.papertrans.cn/17/1605/160427/160427_26.png
彻底明白
发表于 2025-3-26 05:08:25
Vertex Sparsification in Trees,graphs. First, we show how to obtain a 2-quality flow sparsifier with . for such graphs. We then consider the other extreme and construct exact sparsifiers of size ., when the input graph is unweighted.
收集
发表于 2025-3-26 09:55:57
http://reply.papertrans.cn/17/1605/160427/160427_28.png
Tracheotomy
发表于 2025-3-26 14:53:09
F. Kraus,O. Minkowski,A. Schittenhelm building on previous related work (in [., ., .]) and by exploiting a technique we call the Scenario-OR modification. We apply these algorithms to a new problem, Scenario Boolean Function Evaluation. Our results have applciations to other problems involving distributions that are explicitly specified by their support.
mastoid-bone
发表于 2025-3-26 17:35:09
https://doi.org/10.1007/978-3-642-90625-1 than the distance between them. The algorithm can be applied to a 21.752-competitive file allocation algorithm against adaptive online adversaries on outerplanar graphs. We also present a lower bound of 4 for arbitrary deterministic online Steiner tree algorithms on outerplanar graphs.