標(biāo)題: Titlebook: Algorithmic Aspects in Information and Management; 13th International C Ding-Zhu Du,Lian Li,Jialin Zhang Conference proceedings 2019 Spring [打印本頁(yè)] 作者: 黑暗社會(huì) 時(shí)間: 2025-3-21 17:57
書(shū)目名稱Algorithmic Aspects in Information and Management影響因子(影響力)
書(shū)目名稱Algorithmic Aspects in Information and Management影響因子(影響力)學(xué)科排名
書(shū)目名稱Algorithmic Aspects in Information and Management網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Algorithmic Aspects in Information and Management網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Algorithmic Aspects in Information and Management被引頻次
書(shū)目名稱Algorithmic Aspects in Information and Management被引頻次學(xué)科排名
書(shū)目名稱Algorithmic Aspects in Information and Management年度引用
書(shū)目名稱Algorithmic Aspects in Information and Management年度引用學(xué)科排名
書(shū)目名稱Algorithmic Aspects in Information and Management讀者反饋
書(shū)目名稱Algorithmic Aspects in Information and Management讀者反饋學(xué)科排名
作者: 開(kāi)始從未 時(shí)間: 2025-3-21 23:42 作者: FLASK 時(shí)間: 2025-3-22 02:58
Approximating Closest Vector Problem in , Norm Revisited,arning With Errors (LWE) problems. The computational complexity of SIS and LWE problems are related to approximating Shortest Vector Problem (SVP) and Bounded Distance Decoding Problem (BDD). Approximating BDD is a special case of approximating Closest Vector Problem (CVP)..In this paper, we revisit作者: Carminative 時(shí)間: 2025-3-22 06:16
Low-Dimensional Vectors with Density Bounded by 5/6 Are Pinwheel Schedulable,t least once in every . consecutive symbols .. If . has a pinwheel schedule then . is called .. The . of . is defined as .. Chan and Chin [.] made a conjecture that every vector . with . is schedulable..In this paper, we examine the conjecture from the point of view of . vectors, including 3-, 4- an作者: 高腳酒杯 時(shí)間: 2025-3-22 12:17
Constant-Factor Greedy Algorithms for the Asymmetric ,-Center Problem in Parameterized Complete Digand .-CD from the angle of the parameterized upper bound on the ratio of two asymmetric edge-weights between two different vertices and on the ratio of two vertex-weights, respectively. Using the greedy method, we design a .-approximation algorithm for the A.CP in .-CD’s and a .-approximation algori作者: AGONY 時(shí)間: 2025-3-22 16:57 作者: RODE 時(shí)間: 2025-3-22 18:05
A 2.57-Approximation Algorithm for Contig-Based Genomic Scaffold Filling,one of the Genomic Scaffold Filling problem, called One-sided-GSF-max-BC problem. The previous approximation ratio for the problem is 2. However, as we pointed out in the introduction part, the ratio 2 algorithm in the literature can only deal with special instances of the problem, not really solve 作者: Inflated 時(shí)間: 2025-3-22 22:19
Profit Parameterizations of ,his problem feasible in the sense of Parameterized Complexity. We propose two new views to consider ., and a new parameterization of this problem (by the profit parameter) and give algorithms for these parameterizations that show the problems to be in FPT. More precisely, we give a linear-size kerne作者: Inflated 時(shí)間: 2025-3-23 03:17 作者: Ptosis 時(shí)間: 2025-3-23 07:02 作者: 惰性氣體 時(shí)間: 2025-3-23 13:01
The Seeding Algorithm for Spherical ,-Means Clustering with Penalties,a collection of given data with unit length into . sets so as to minimize the within-cluster sum of cosine dissimilarity. In this paper, we introduce the spherical .-means clustering with penalties and give a .-approximate algorithm, where . is the ratio of the maximal and the minimal penalty values作者: 包庇 時(shí)間: 2025-3-23 15:29
Approximation Algorithm for the Correlation Clustering Problem with Non-uniform Hard Constrained Cltering problem. In this problem, we are given a positive integer . for each vertex ., and require . for any cluster .. We provide a (2,?4)-bicriteria approximation algorithm for this problem. Namely, the solution returned by the algorithm has the cost that is at most 4 times the optimum, and for eac作者: BOOST 時(shí)間: 2025-3-23 18:39 作者: CREST 時(shí)間: 2025-3-24 00:52
Approximation Algorithms for the Minimum Power Partial Cover Problem,, each sensor can adjust its power, the covering range of a sensor . with power .(.) is a disk centered at . which has radius .(.) satisfying .. Given an integer ., the MinPowerPartCov problem is to determine the power assignment on each sensor such that at least . points are covered and the total p作者: 采納 時(shí)間: 2025-3-24 05:45 作者: annexation 時(shí)間: 2025-3-24 07:17
0302-9743 retical computer science and their applications. Special considerations are given to algorithmic research that is motivated by real-world applications.?.978-3-030-27194-7978-3-030-27195-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 傲慢人 時(shí)間: 2025-3-24 13:22
Introduction to Dense Optical Flowertain. We show that, the .-gathering problem can be solved in . and . time when the customers and the facilities are on a line, and the customer locations are given by piecewise uniform functions of at most . pieces and “well-separated” uniform distribution functions, respectively.作者: Blatant 時(shí)間: 2025-3-24 15:33 作者: 不能根除 時(shí)間: 2025-3-24 21:26 作者: obnoxious 時(shí)間: 2025-3-24 23:27 作者: 類人猿 時(shí)間: 2025-3-25 07:06 作者: 完全 時(shí)間: 2025-3-25 08:15 作者: 彎彎曲曲 時(shí)間: 2025-3-25 15:24 作者: elucidate 時(shí)間: 2025-3-25 18:49 作者: ABASH 時(shí)間: 2025-3-25 20:38
Updating Matrix Polynomials, polynomials. First, we present .(.)-, .- and .-operations update algorithms for 2-order, 3-order and 4-order matrix polynomials, respectively. Furthermore, we discuss the update of high-order matrix polynomials with a . coefficient vector and as a result, propose a . heuristic updating method based on . in a directed acyclic graph.作者: Horizon 時(shí)間: 2025-3-26 04:08
Interaction-Aware Influence Maximization and Iterated Sandwich Method,ical issue, we analyze its complexity and modularity, propose the sandwich theory which is based on decomposing the non-submodular objective function into the difference of two submodular functions and design iterated sandwich algorithm which is guaranteed to get data dependent approximation solution.作者: nonplus 時(shí)間: 2025-3-26 05:06 作者: misshapen 時(shí)間: 2025-3-26 12:11
Prototypology and the Twenty-First Century,ontrast to Golovnen’s approximation scheme for TSP on directed graphs with . time. We also show that there is no . time constant factor approximation for the TSP problem under Exponential Time Hypothesis in complexity theory.作者: osteopath 時(shí)間: 2025-3-26 16:26 作者: 骯臟 時(shí)間: 2025-3-26 18:37 作者: 好開(kāi)玩笑 時(shí)間: 2025-3-26 22:09
Approximating Closest Vector Problem in , Norm Revisited, the study for approximating Closest Vector Problem. We give one proof that approximating the Closest Vector Problem over . norm (.) within any constant factor is NP-hard. The result is obtained by the gap-preserving reduction from Min Total Label Cover problem in . norm to .. This proof is simpler than known proofs.作者: FLIP 時(shí)間: 2025-3-27 05:08 作者: dilute 時(shí)間: 2025-3-27 07:46 作者: 先兆 時(shí)間: 2025-3-27 11:25 作者: 厭惡 時(shí)間: 2025-3-27 15:23
Introduction to Dense Optical Flowacility has zero or at least . customers. The .-gathering problem asks to find an .-gathering that minimizes the maximum distance between a customer and its facility. In this paper we study the .-gathering problem when the customers and the facilities are on a line, and each customer location is unc作者: Instrumental 時(shí)間: 2025-3-27 18:52 作者: evaculate 時(shí)間: 2025-3-28 01:31 作者: Compass 時(shí)間: 2025-3-28 03:36 作者: Cupping 時(shí)間: 2025-3-28 08:54 作者: angiography 時(shí)間: 2025-3-28 10:37
W.A. Baan,Y. Hagiwara,H.J. Langevelderward re-calculation of . would require . arithmetic operations, where . and . depends on the strategy of computing . appearing in ., using the fastest square matrix multiplication algorithm by Fran?ois Le Gall (ISSAC’14). In this paper, we assume that . is a . matrix and that . is known while no ot作者: 別炫耀 時(shí)間: 2025-3-28 14:38
Low-Luminosity Extra-Galactic H20 Masersone of the Genomic Scaffold Filling problem, called One-sided-GSF-max-BC problem. The previous approximation ratio for the problem is 2. However, as we pointed out in the introduction part, the ratio 2 algorithm in the literature can only deal with special instances of the problem, not really solve 作者: 撤退 時(shí)間: 2025-3-28 19:32
Prototypology and the Twenty-First Century,his problem feasible in the sense of Parameterized Complexity. We propose two new views to consider ., and a new parameterization of this problem (by the profit parameter) and give algorithms for these parameterizations that show the problems to be in FPT. More precisely, we give a linear-size kerne作者: mechanism 時(shí)間: 2025-3-28 22:58
Prototypology and the Twenty-First Century,h edge is a nonnegative real number, then there is an algorithm to give an . approximation for the TSP problem in . and a polynomial space. It is in contrast to Golovnen’s approximation scheme for TSP on directed graphs with . time. We also show that there is no . time constant factor approximation 作者: 施舍 時(shí)間: 2025-3-29 05:19
Taking Urban Greening to a Higher Level,ximization of influence spread under the assumption that the number of influenced users determines the success of a product promotion. However, the profit of some products such as online game depends on the interactions among users besides the number of users. In this paper, we take both the number 作者: 遣返回國(guó) 時(shí)間: 2025-3-29 09:08
https://doi.org/10.1007/978-1-4757-0106-7a collection of given data with unit length into . sets so as to minimize the within-cluster sum of cosine dissimilarity. In this paper, we introduce the spherical .-means clustering with penalties and give a .-approximate algorithm, where . is the ratio of the maximal and the minimal penalty values作者: 干涉 時(shí)間: 2025-3-29 14:09 作者: Spirometry 時(shí)間: 2025-3-29 17:51 作者: 母豬 時(shí)間: 2025-3-29 20:31 作者: canvass 時(shí)間: 2025-3-30 02:01
of the problem of minimum-cost edge-weighted subgraph constructions (MCEWSC, for short). This new problem has many important applications in our reality life, and it is defined as follows. In the MCEWSC problem ., the objective is to choose a minimum-cost subset of edges from a graph such that thes作者: laceration 時(shí)間: 2025-3-30 05:23 作者: 共和國(guó) 時(shí)間: 2025-3-30 10:21
978-3-030-27194-7Springer Nature Switzerland AG 2019作者: Aprope 時(shí)間: 2025-3-30 14:20
Ce Liu,Jenny Yuen,Antonio TorralbaIn this paper we combine the Schwartz-Zippel theorem with statistical inference theory and develop a new probabilistic algorithm instead of deterministic algorithms for geometry theorem proving. Our work includes an improved algorithm for estimating the upper bounds in the pseudo-remainder, and three selection criteria for statistical populations.作者: 偽造 時(shí)間: 2025-3-30 19:14
Dense and Green Building TypologiesIn this paper, we study the edge metric dimension problem (EMDP). We establish a potential function and give a corresponding greedy algorithm with approximation ratio ., where . is the number of vertices in the graph ..作者: 招惹 時(shí)間: 2025-3-31 00:44 作者: inclusive 時(shí)間: 2025-3-31 01:08 作者: 預(yù)感 時(shí)間: 2025-3-31 07:35 作者: 逗留 時(shí)間: 2025-3-31 11:12
A Primal Dual Approximation Algorithm for the Multicut Problem in Trees with Submodular Penalties,In this paper, we introduce the multicut problem in trees with submodular penalties, which generalizes the prize-collecting multicut problem in trees and vertex cover with submodular penalties. We present a combinatorial 3-approximation algorithm, based on the primal-dual scheme for the multicut problem in trees.作者: Omnipotent 時(shí)間: 2025-3-31 14:52
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152891.jpg作者: 加強(qiáng)防衛(wèi) 時(shí)間: 2025-3-31 18:51 作者: etiquette 時(shí)間: 2025-4-1 00:27
https://doi.org/10.1007/978-3-642-12866-0and .-CD from the angle of the parameterized upper bound on the ratio of two asymmetric edge-weights between two different vertices and on the ratio of two vertex-weights, respectively. Using the greedy method, we design a .-approximation algorithm for the A.CP in .-CD’s and a .-approximation algorithm for the WA.CP in .-CD’s, respectively.作者: 兩棲動(dòng)物 時(shí)間: 2025-4-1 03:36 作者: 豪華 時(shí)間: 2025-4-1 06:27
https://doi.org/10.1007/978-1-4757-0106-7a collection of given data with unit length into . sets so as to minimize the within-cluster sum of cosine dissimilarity. In this paper, we introduce the spherical .-means clustering with penalties and give a .-approximate algorithm, where . is the ratio of the maximal and the minimal penalty values of the given data set.作者: Matrimony 時(shí)間: 2025-4-1 12:02 作者: eulogize 時(shí)間: 2025-4-1 17:48
Constant-Factor Greedy Algorithms for the Asymmetric ,-Center Problem in Parameterized Complete Digand .-CD from the angle of the parameterized upper bound on the ratio of two asymmetric edge-weights between two different vertices and on the ratio of two vertex-weights, respectively. Using the greedy method, we design a .-approximation algorithm for the A.CP in .-CD’s and a .-approximation algorithm for the WA.CP in .-CD’s, respectively.
