標(biāo)題: Titlebook: Combinatorial Optimization and Applications; 13th International C Yingshu Li,Mihaela Cardei,Yan Huang Conference proceedings 2019 Springer [打印本頁] 作者: incoherent 時間: 2025-3-21 19:23
書目名稱Combinatorial Optimization and Applications影響因子(影響力)
書目名稱Combinatorial Optimization and Applications影響因子(影響力)學(xué)科排名
書目名稱Combinatorial Optimization and Applications網(wǎng)絡(luò)公開度
書目名稱Combinatorial Optimization and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Combinatorial Optimization and Applications被引頻次
書目名稱Combinatorial Optimization and Applications被引頻次學(xué)科排名
書目名稱Combinatorial Optimization and Applications年度引用
書目名稱Combinatorial Optimization and Applications年度引用學(xué)科排名
書目名稱Combinatorial Optimization and Applications讀者反饋
書目名稱Combinatorial Optimization and Applications讀者反饋學(xué)科排名
作者: Indent 時間: 2025-3-21 22:20 作者: Precursor 時間: 2025-3-22 02:24 作者: Indelible 時間: 2025-3-22 05:52 作者: 天文臺 時間: 2025-3-22 10:55 作者: arrogant 時間: 2025-3-22 13:48
Algorithmic Pricing for the Partial Assignment,l welfare. We then analyze two pricing schemes to approximate the optimal social welfare. In the trade-off pricing scheme, an .(.)-approximation algorithm can be achieved if considering the subset of the bundle, where . is the maximal cardinality of the assigned bundle among all buyers. In the item-作者: arrogant 時間: 2025-3-22 20:51
Recognizing the Tractability in Big Data Computing,linear time after a PTIME preprocessing by reducing the size of input dataset. . includes all the problems that can solved by a RATM in sublinear time after a PTIME preprocessing by extending the size of input dataset. The relations among the two pseudo-tractable classes and other complexity classes作者: 改良 時間: 2025-3-22 22:59 作者: 蕁麻 時間: 2025-3-23 03:14
Thomas Roche,Laurent Imbert,Victor Lomnéea of scheduling long jobs in parallel with short jobs to obtain solutions with tightly satisfied packing and bounded job start constraints. For a broad family of instances excluding degenerate instances with many very long jobs and instances with few machines, we derive a 1.985-approximation ratio.作者: 同步左右 時間: 2025-3-23 09:36 作者: 施魔法 時間: 2025-3-23 11:12 作者: gruelling 時間: 2025-3-23 14:20
Xin Ye,Thomas Eisenbarth,William Martingated. This paper contains two results: first, we introduce a new parameter . which denotes the number of different disk sizes in the input. In contrast to previously considered parameters, . is upper bounded by .. For the case that disk sizes and priorities coincide, we design an algorithm which ru作者: Lyme-disease 時間: 2025-3-23 22:06 作者: geometrician 時間: 2025-3-23 23:14
Marios O. Choudary,Markus G. Kuhnl welfare. We then analyze two pricing schemes to approximate the optimal social welfare. In the trade-off pricing scheme, an .(.)-approximation algorithm can be achieved if considering the subset of the bundle, where . is the maximal cardinality of the assigned bundle among all buyers. In the item-作者: 大約冬季 時間: 2025-3-24 02:57 作者: 創(chuàng)造性 時間: 2025-3-24 07:09
Conference proceedings 2019vacy, underwater and underground networks, vehicular networks, information processing and data management, programmable service interfaces, energy-efficient algorithms, system and protocol design, operating system and middleware support, and experimental test-beds, models and case studies.作者: Archipelago 時間: 2025-3-24 14:12 作者: Confound 時間: 2025-3-24 18:13 作者: predict 時間: 2025-3-24 21:05 作者: LAVA 時間: 2025-3-25 03:08
https://doi.org/10.1007/978-3-030-42068-0tem goal of load balance, we estimate the PoAs of this class of games, provided all players follow one of the four decision-making principles, namely the bottom-out, win-or-go-home, average-case-analysis, and minimax-regret principles.作者: 護(hù)航艦 時間: 2025-3-25 06:35 作者: Anticoagulant 時間: 2025-3-25 10:19 作者: 尊嚴(yán) 時間: 2025-3-25 13:22 作者: Offstage 時間: 2025-3-25 17:46
Balanced Connected Subgraph Problem in Geometric Intersection Graphs,, we give algorithms for the.problem on both interval and circular-arc graphs, and those algorithms are used as subroutines for solving the .?problem on the same classes of graphs. Finally, we present a FPT?algorithm for the .?problem on general graphs.作者: Expand 時間: 2025-3-25 21:55 作者: Pigeon 時間: 2025-3-26 03:24
The Price of Anarchy for the Load Balancing Game with a Randomizing Scheduler,tem goal of load balance, we estimate the PoAs of this class of games, provided all players follow one of the four decision-making principles, namely the bottom-out, win-or-go-home, average-case-analysis, and minimax-regret principles.作者: bromide 時間: 2025-3-26 05:13 作者: PALMY 時間: 2025-3-26 09:20 作者: Jogging 時間: 2025-3-26 16:15 作者: 油氈 時間: 2025-3-26 20:36 作者: minaret 時間: 2025-3-26 22:20
0302-9743 d in Xiamen, China, in December 2019.. The 49 full papers presented in this volume were carefully reviewed and selected from 108 submissions. The papers cover the various topics, including cognitive radio networks, wireless sensor networks, cyber-physical systems, distributed and localized algorithm作者: 饒舌的人 時間: 2025-3-27 03:34 作者: 稀釋前 時間: 2025-3-27 06:21
,Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five?Elements,s a lower bound on schemes storing five elements. In this work, we have improved the lower bound to .. We also present a scheme for the same that takes . space. This improves upon the .-scheme due to Garg?[.] and the .-scheme due to Baig .?[.].作者: FOIL 時間: 2025-3-27 12:36
A Randomized Approximation Algorithm for Metric Triangle Packing, MMWTP), where the edge weights in the input graph satisfy the triangle inequality. In this paper, we design the first nontrivial polynomial-time approximation algorithm for MMWTP. Our algorithm is randomized and achieves an expected approximation ratio of . for any constant ..作者: 貪婪地吃 時間: 2025-3-27 14:05
Approximate Shortest Paths in Polygons with Violations, are allowed to be in .. The path segments are not allowed to bend in .. For any ., we present a . factor approximation algorithm for the problem, that runs in . time. Here . and ., ., . are geometric parameters.作者: 秘密會議 時間: 2025-3-27 18:24
Conference proceedings 2019n, China, in December 2019.. The 49 full papers presented in this volume were carefully reviewed and selected from 108 submissions. The papers cover the various topics, including cognitive radio networks, wireless sensor networks, cyber-physical systems, distributed and localized algorithm design an作者: 沒有貧窮 時間: 2025-3-28 00:02
https://doi.org/10.1007/978-3-030-42068-0 MMWTP), where the edge weights in the input graph satisfy the triangle inequality. In this paper, we design the first nontrivial polynomial-time approximation algorithm for MMWTP. Our algorithm is randomized and achieves an expected approximation ratio of . for any constant ..作者: 急性 時間: 2025-3-28 03:49
How to Use Koblitz Curves on Small Devices? are allowed to be in .. The path segments are not allowed to bend in .. For any ., we present a . factor approximation algorithm for the problem, that runs in . time. Here . and ., ., . are geometric parameters.作者: negotiable 時間: 2025-3-28 08:13 作者: BROW 時間: 2025-3-28 10:54 作者: 障礙 時間: 2025-3-28 17:56 作者: Celiac-Plexus 時間: 2025-3-28 19:14
Balanced Connected Subgraph Problem in Geometric Intersection Graphs,iven a.graph ., where each vertex in . is colored with either “.” or “.”, the .?problem seeks a maximum cardinality induced connected subgraph . of . such that . is., i.e., . contains an equal number of red and blue vertices. We study the computational complexity landscape of the .?problem while con作者: Orgasm 時間: 2025-3-28 23:26 作者: 游行 時間: 2025-3-29 05:49
Contact Representations of Directed Planar Graphs in 2D and 3D,ntacts between those objects, which are examples of a drawing style called .. We study the feasibility of using line segments, triangles and tetrahedra to realize point-side contact representations for a number of graph classes including oriented versions of outerplanar graphs, 2-trees and 3-trees. 作者: Omniscient 時間: 2025-3-29 07:38
Identifying Structural Hole Spanners in Social Networks via Graph Embedding,ural hole spanners in social networks has received great attention in recent years. Existing SH spanners detection methods usually rely on graph theory knowledge. However, these methods have obvious drawbacks of poor performance and expensive computation for largescale networks. In this work, we pro作者: COW 時間: 2025-3-29 15:03 作者: pericardium 時間: 2025-3-29 18:58 作者: Lethargic 時間: 2025-3-29 23:46
Approximation Algorithms for Maximally Balanced Connected Graph Partition,d, and the partition is maximally balanced in the way that the maximum cardinality of these . parts is minimized. We refer this problem to as . into . parts and denote it as . .. The general vertex-weighted version of this problem on trees has been studied since about four decades ago, which admits 作者: BILK 時間: 2025-3-30 03:58
Edge Exploration of a Graph by Mobile Agent, node of degree . are arbitrarily numbered .. A mobile agent, starting from some node, has to visit all the edges of the graph and stop. The time of the exploration is the number of edges the agent traverses before it stops. The task of exploration can not be performed even for a class of cycles if 作者: Cumulus 時間: 2025-3-30 04:34
,Fast Diameter Computation Within Split?Graphs,that although the diameter of a non-complete split graph can only be either 2 or 3, under the Strong Exponential-Time Hypothesis (SETH) we cannot compute the diameter of a split graph in less than quadratic time. Therefore it is worth to study the complexity of diameter computation on . of split gra作者: certitude 時間: 2025-3-30 09:23 作者: Benzodiazepines 時間: 2025-3-30 15:51
Parametrized Runtimes for Label Tournaments,n zoomed-out views. This is modelled as a label tournament where the labels are represented as disks growing inversely proportional to a continuously decreasing zoom level. Due to that growth, labels would eventually overlap impairing the readability of the map. Hence whenever two labels touch, the 作者: 一罵死割除 時間: 2025-3-30 19:52
The ,-Delivery Traveling Salesman Problem: Revisited,node either holds an item or requires an item, and a vehicle of capacity of . which can carry at most . items at a time, one is asked to schedule a shortest route for the vehicle so that it starts from a depot and transports all items from the points holding them to the points requiring items, and r作者: 使出神 時間: 2025-3-30 21:02
Algorithmic Pricing for the Partial Assignment,et of budgets . on each item .. The seller knows the whole information of the buyers and decides the price for each item so as to maximize the social welfare. Buyers come in an arbitrary order. When a buyer comes, each item can be only sold integrally. In previous works, if a buyer’s interested bund作者: Sarcoma 時間: 2025-3-31 02:59 作者: 多嘴多舌 時間: 2025-3-31 06:46
,A Novel Virtual Traffic Light Algorithm Based on V2V for Single Intersection in?Vehicular Networks,’t transfer the wayleave until they all pass completely. This method cannot achieve the maximum road traffic throughput capacity. This paper designs a queuing chain model and proposes a virtual traffic lights algorithm for Single Intersection (for short SVTL) based on the queuing chain model, consid作者: BALE 時間: 2025-3-31 12:15
https://doi.org/10.1007/978-3-030-36412-0approximation algorithms; bioinformatics; communication network optimization; complex network optimizat作者: nitric-oxide 時間: 2025-3-31 16:11 作者: 用不完 時間: 2025-3-31 20:21
Multipurpose Cryptographic Primitive ,We show that finding a minimum-width orthogonal upward drawing of a phylogenetic tree is NP-hard for binary trees with unconstrained combinatorial order and provide a linear-time algorithm for ordered trees. We also study several heuristic algorithms for the unconstrained case and show their effectiveness through experimentation.作者: 性學(xué)院 時間: 2025-4-1 00:45 作者: entreat 時間: 2025-4-1 01:53
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229972.jpg作者: Jejune 時間: 2025-4-1 09:16 作者: scoliosis 時間: 2025-4-1 13:07
Chong Hee Kim,Jean-Jacques Quisquater graph optimization, a critical edge is an edge which can be deleted to reduce a graph measure, such as the size of the minimum vertex cover. We prove a reduction between critical rows in matrices and critical edges in graphs. Additionally, we describe and experimentally test an algorithm to identify the critical row of a matrix.作者: 阻擋 時間: 2025-4-1 15:57
