標題: Titlebook: Algorithmic Aspects in Information and Management; 14th International C Zhao Zhang,Wei Li,Ding-Zhu Du Conference proceedings 2020 Springer [打印本頁] 作者: Cyclone 時間: 2025-3-21 19:57
書目名稱Algorithmic Aspects in Information and Management影響因子(影響力)
書目名稱Algorithmic Aspects in Information and Management影響因子(影響力)學科排名
書目名稱Algorithmic Aspects in Information and Management網(wǎng)絡公開度
書目名稱Algorithmic Aspects in Information and Management網(wǎng)絡公開度學科排名
書目名稱Algorithmic Aspects in Information and Management被引頻次
書目名稱Algorithmic Aspects in Information and Management被引頻次學科排名
書目名稱Algorithmic Aspects in Information and Management年度引用
書目名稱Algorithmic Aspects in Information and Management年度引用學科排名
書目名稱Algorithmic Aspects in Information and Management讀者反饋
書目名稱Algorithmic Aspects in Information and Management讀者反饋學科排名
作者: 格言 時間: 2025-3-21 22:01 作者: LAIR 時間: 2025-3-22 03:24
Sebastian Horn,Julia Seeger,Leonie Scheuringic . problem, and was proved to have surprisingly rich connection to the . . problem. In this paper, we give approximation algorithms for . using a non-uniform approach combining LP-rounding and the greedy strategy. With a limited violation of the constraint ., we present a good expected approximation ratio . for ..作者: 保留 時間: 2025-3-22 05:04 作者: 團結 時間: 2025-3-22 09:06 作者: 鎮(zhèn)痛劑 時間: 2025-3-22 16:12 作者: 箴言 時間: 2025-3-22 18:42
Stephan Schütz,Christian Hellmundd the generic submodularity ratio . of the monotone set function, we prove the algorithm deserves an approximation ratio ., consumes . adaptive rounds, and needs . oracle queries in expectation. Moreover, if the set function is submodular (i. e. .), our algorithm can achieve an approximation guarantee . coinciding with the state-of-art result.作者: Bernstein-test 時間: 2025-3-23 00:27
Minimum Diameter Vertex-Weighted Steiner Tree, approximation algorithm where . is tight. For the MDWSTP in vertex-weighted .-PG, we first obtain a .-factor approximation algorithm where . is tight, and then develop a slightly improved approximation algorithm.作者: 孵卵器 時間: 2025-3-23 01:47
Approximation Algorithms for the Lower-Bounded Knapsack Median Problem,nd the improved second algorithm is based on an intuitive observation. Additionally, we adapt these two algorithms to the lower-bounded .-median problem (LB .-median) and obtain the approximation ratios of 610 and 387.作者: 擦試不掉 時間: 2025-3-23 06:43 作者: 令人悲傷 時間: 2025-3-23 11:08
Conference proceedings 2020 Jinhua, China in August 2020. . The 39 full papers and 17 short papers presented were carefully reviewed and selected from 76 submissions. The papers deal with emerging important algorithmic problems with a focus on the fundamental background, theoretical technology development, and real-world appl作者: promote 時間: 2025-3-23 14:16
https://doi.org/10.1007/978-3-322-92431-5cting polygon problem, which asks for a (convex) polygon . of minimum perimeter such that . contains at least one point of every given line segment. Both of our algorithms run in . time, and they solve two long-standing open problems in computational geometry.作者: Commentary 時間: 2025-3-23 20:57 作者: 噴出 時間: 2025-3-24 01:40 作者: 種屬關系 時間: 2025-3-24 03:01 作者: 時間等 時間: 2025-3-24 10:04
Approximation Algorithm for Stochastic Set Cover Problem,stic set cover problem with submodular penalties (4-approximation algorithm for the stochastic vertex cover problem with submodular penalties when .), where . is the maximum frequency of the element in the family of subsets.作者: 植物茂盛 時間: 2025-3-24 14:33 作者: notification 時間: 2025-3-24 17:27
0302-9743 0, held in Jinhua, China in August 2020. . The 39 full papers and 17 short papers presented were carefully reviewed and selected from 76 submissions. The papers deal with emerging important algorithmic problems with a focus on the fundamental background, theoretical technology development, and real-作者: Incompetent 時間: 2025-3-24 21:26 作者: 不利 時間: 2025-3-25 02:16
Sebastian Horn,Dennis Thorwartheach data point to its closest center. We present a constant expected approximation guarantee for this problem based on integrating the .-means++ seeding algorithm for the KMP and the local search technique.作者: Offstage 時間: 2025-3-25 05:32 作者: Bronchial-Tubes 時間: 2025-3-25 07:32 作者: 人類的發(fā)源 時間: 2025-3-25 13:35 作者: investigate 時間: 2025-3-25 18:54
A Bi-criteria Analysis for Fuzzy ,-means Problem,r centers can achieve . and .(.) approximation. Preliminary numerical experiments are proposed to support the theoretical results of the paper, in which we run these algorithms on real data sets with different parameter values.作者: Colonoscopy 時間: 2025-3-25 23:28 作者: WITH 時間: 2025-3-26 03:44
Approximating Max ,-Uncut via LP-rounding Plus Greed, with Applications to Densest ,-Subgraph,ic . problem, and was proved to have surprisingly rich connection to the . . problem. In this paper, we give approximation algorithms for . using a non-uniform approach combining LP-rounding and the greedy strategy. With a limited violation of the constraint ., we present a good expected approximation ratio . for ..作者: 發(fā)牢騷 時間: 2025-3-26 06:45 作者: 載貨清單 時間: 2025-3-26 11:06 作者: 有雜色 時間: 2025-3-26 16:18
https://doi.org/10.1007/978-3-322-92431-5t tours or intersects . given rays. We show that it can be reduced to the problem of computing a shortest route that intersects a set of ray-segments, inside a circle; at least one endpoint of every ray-segment is on the circle. Moreover, computing the shortest route intersecting all ray-segments in作者: 圍巾 時間: 2025-3-26 20:18
https://doi.org/10.1007/978-3-476-02749-8a geometric region in .. They can be applied to represent a rich class of geometric objects, which include all polyhedra and the union of a finite number of polyhedron. They can be also used to approximate a large class of .-dimensional manifolds in .. Barvinok?[.] developed polynomial time algorith作者: Creditee 時間: 2025-3-27 00:04 作者: enhance 時間: 2025-3-27 01:36
Denkfallen und Programmierfehler two stage, finite scenarios stochastic versions of set cover problem with submodular penalties which is the generalization of the stochastic vertex cover problem with submodular penalties. The goal is to minimize the sum of the first stage cost, the expected second stage cost and the expected penal作者: 攤位 時間: 2025-3-27 07:46
https://doi.org/10.1007/978-3-642-75324-4 plane ., we are asked to find the location of a line . and a Steiner tree .(.), which consists of vertical and horizontal line segments plus the line ., to interconnect these . points and at least one point on the line ., the objective is to minimize total weight of .(.), ., . | .(.) is a Steiner t作者: 盟軍 時間: 2025-3-27 11:14 作者: Kidney-Failure 時間: 2025-3-27 15:18 作者: Medicare 時間: 2025-3-27 18:27
https://doi.org/10.1007/978-3-658-21663-4e . and an independent set of size ., such that each node in the independent set is adjacent to exactly one node in the clique. For various optimization objective functions studied in the literature, we present improved hardness and approximation results.作者: palpitate 時間: 2025-3-28 01:55 作者: Throttle 時間: 2025-3-28 02:35 作者: Ballad 時間: 2025-3-28 08:40
https://doi.org/10.1007/978-3-658-11983-6f clients, a budget . and a lower bound .. Every facility is associated with a weight. Every facility-client pair is associated with a connection cost. The aim is to select a subset of facilities to open and connect every client to some opened facility, such that the total weights of the selected fa作者: badinage 時間: 2025-3-28 12:58
Sebastian Horn,Dennis Thorwarthional unit sphere ., and an integer ., it aims to partition the data set . into . sets so as to minimize the sum of cosine dissimilarity measure from each data point to its closest center. We present a constant expected approximation guarantee for this problem based on integrating the .-means++ seed作者: catagen 時間: 2025-3-28 17:57
Sebastian Horn,Dennis Thorwarthall set of points called outliers (as a constraint, the number of outliers can not be greater than a given integer) can be ignored. Using local search method, we give a constant-factor approximation algorithm that may violate slightly the constraint about the number of outliers.作者: tympanometry 時間: 2025-3-28 22:02 作者: 安裝 時間: 2025-3-29 01:19
Sebastian Horn,Julia Seeger,Leonie Scheurings, and a positive integer ., the . problem asks to find a partition . of . such that the total weight of edges that are . cut is maximized. . can also be viewed as a clustering problem with the measure being the total weight of uncut edges in the solution. This problem is the complement of the class作者: 繁榮中國 時間: 2025-3-29 06:39 作者: monochromatic 時間: 2025-3-29 07:41 作者: jocular 時間: 2025-3-29 11:47
Stephan Schütz,Christian Hellmundhip between OPT and the maximum marginal gain of the elements in the ground set, the algorithm first calculates all possible values of OPT, then computes in parallel a family of sets each of which corresponding to each value of OPT, and lastly selects the set with maximum value as the desired soluti作者: Facilities 時間: 2025-3-29 16:59 作者: 歡樂東方 時間: 2025-3-29 20:46 作者: HALL 時間: 2025-3-30 03:30
978-3-030-57601-1Springer Nature Switzerland AG 2020作者: 蔓藤圖飾 時間: 2025-3-30 07:01 作者: installment 時間: 2025-3-30 09:56
https://doi.org/10.1007/978-3-658-21663-4e . and an independent set of size ., such that each node in the independent set is adjacent to exactly one node in the clique. For various optimization objective functions studied in the literature, we present improved hardness and approximation results.作者: 討人喜歡 時間: 2025-3-30 13:24 作者: CRANK 時間: 2025-3-30 16:39
Sebastian Horn,Dennis Thorwarthall set of points called outliers (as a constraint, the number of outliers can not be greater than a given integer) can be ignored. Using local search method, we give a constant-factor approximation algorithm that may violate slightly the constraint about the number of outliers.作者: HUMP 時間: 2025-3-30 22:10
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152885.jpg作者: senile-dementia 時間: 2025-3-31 03:16 作者: Fulminate 時間: 2025-3-31 09:00 作者: dandruff 時間: 2025-3-31 10:24 作者: habile 時間: 2025-3-31 14:27 作者: LEERY 時間: 2025-3-31 21:34
On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane r tree (CMRST) problem..We obtain three main results as follows. (1) We design an exact algorithm in time . to solve the CMRST problem; (2) We show that the same algorithm in (1) is a 1.5-approximation algorithm to solve the 1LF-MRST problem; (3) Using a combination of the algorithm in (1) for many 作者: Fraudulent 時間: 2025-3-31 22:37 作者: Insatiable 時間: 2025-4-1 04:39
Adaptive Robust Submodular Optimization and Beyond,icular, our algorithm achieves approximation ratio . when considering a single matroid constraint. At last, we present two heuristics for the general case with nearly submodular functions. All proposed solutions are non-adaptive which are easy to implement.作者: HUSH 時間: 2025-4-1 08:49
https://doi.org/10.1007/978-3-476-02749-8l time in . to solve integer linear programming problem with . be the total number of input linear inequalities. We develop algorithms to count the number of lattice points in geometric region determined by a polyhedral circuit in . time and to compute the volume of geometric region determined by a 作者: CON 時間: 2025-4-1 13:55
https://doi.org/10.1007/978-3-642-75324-4r tree (CMRST) problem..We obtain three main results as follows. (1) We design an exact algorithm in time . to solve the CMRST problem; (2) We show that the same algorithm in (1) is a 1.5-approximation algorithm to solve the 1LF-MRST problem; (3) Using a combination of the algorithm in (1) for many 作者: Anemia 時間: 2025-4-1 16:42
Aufbereitung und Auswertung der Daten,get allocation problem is monotone and DR-submodular, then a greedy algorithm is devised to get a . approximation ratio; then we solve the Protector Seed Selection (PSS) problem in the second stage after we obtained the budget allocation vector for communities, we greedily choose protectors for each作者: 擁護者 時間: 2025-4-1 19:43
