標(biāo)題: Titlebook: Algorithms and Complexity; 9th International Co Vangelis Th. Paschos,Peter Widmayer Conference proceedings 2015 Springer International Publ [打印本頁(yè)] 作者: 自由才謹(jǐn)慎 時(shí)間: 2025-3-21 18:13
書(shū)目名稱(chēng)Algorithms and Complexity影響因子(影響力)
書(shū)目名稱(chēng)Algorithms and Complexity影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Algorithms and Complexity網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Algorithms and Complexity網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Algorithms and Complexity被引頻次
書(shū)目名稱(chēng)Algorithms and Complexity被引頻次學(xué)科排名
書(shū)目名稱(chēng)Algorithms and Complexity年度引用
書(shū)目名稱(chēng)Algorithms and Complexity年度引用學(xué)科排名
書(shū)目名稱(chēng)Algorithms and Complexity讀者反饋
書(shū)目名稱(chēng)Algorithms and Complexity讀者反饋學(xué)科排名
作者: cluster 時(shí)間: 2025-3-21 23:29 作者: 橡子 時(shí)間: 2025-3-22 02:27 作者: 在駕駛 時(shí)間: 2025-3-22 05:02
Orthogonal Graph Drawing with Inflexible Edges,dge. More precisely, we have a . assigning to each edge . a natural number ., its .. The problem . asks whether there exists an orthogonal drawing such that each edge . has at most . bends. It is known that . is NP-hard if . for every edge .?[.]. On the other hand, . can be solved efficiently if .?[作者: SPECT 時(shí)間: 2025-3-22 10:33 作者: dissent 時(shí)間: 2025-3-22 14:29
Competitive Strategies for Online Clique Clustering, its cliques. We consider the online variant of the clique clustering problem, where the vertices of the input graph arrive one at a time. At each step, the newly arrived vertex forms a singleton clique, and the algorithm can merge any existing cliques in its partitioning into larger cliques, but sp作者: 安定 時(shí)間: 2025-3-22 20:25 作者: electrolyte 時(shí)間: 2025-3-22 21:21 作者: STELL 時(shí)間: 2025-3-23 03:14
Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract),of the disk. At any time the robots can move anywhere they choose on the disk, independently of each other, with maximum speed .. The robots can cooperate by exchanging information whenever they meet. We study algorithms for the two robots to minimize the .: the time when . robots reach the exit. In作者: 符合規(guī)定 時(shí)間: 2025-3-23 07:52
Planarity of Streamed Graphs, streamed graph is .. with respect to a positive integer window size . if there exists a sequence of planar topological drawings . of the graphs . such that the common graph . is drawn the same in . and in ., for .. The . Problem with window size . asks whether a given streamed graph is .-stream pla作者: 嚴(yán)厲譴責(zé) 時(shí)間: 2025-3-23 10:14
Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs,e-width if and only if . is an induced subgraph of the 4-vertex path .. We study the (un)boundedness of the clique-width of graph classes defined by two forbidden induced subgraphs . and .. Prior to our study it was not known whether the number of open cases was finite. We provide a positive answer 作者: ineptitude 時(shí)間: 2025-3-23 14:15
Randomized Adaptive Test Cover, an unknown target element using a minimum number of tests. We explore the expected test number of randomized strategies. We obtain several general results on the ratio of the expected and worst-case deterministic test number, as well as complexity results for hypergraphs of small rank, and we state作者: Amnesty 時(shí)間: 2025-3-23 21:10 作者: 變色龍 時(shí)間: 2025-3-24 00:44
On the Complexity of Wafer-to-Wafer Integration,. disjoints sets (called “l(fā)ots”), where each set contains . wafers. The output of the problem is a set of . disjoint stacks, where a stack is a set of . wafers (one wafer from each lot). To each stack we associate a .-dimensional binary vector corresponding to the bit-wise AND operation of the wafer作者: 摻和 時(shí)間: 2025-3-24 06:19
Label Placement in Road Maps, section. We consider the cartographic problem to place non-overlapping road labels along the edges so that as many road sections as possible are identified by their name, i.e., covered by a label. We show that this is NP-hard in general, but the problem can be solved in polynomial time if the road 作者: intertwine 時(shí)間: 2025-3-24 07:30
Discrete Stochastic Submodular Maximization: Adaptive vs. Non-adaptive vs. Offline,e gap between the optimal offline and online solutions. We present a procedure that transforms a decision tree (adaptive algorithm) into a non-adaptive chain. We prove that this chain achieves at least . times the utility of the decision tree, over a product distribution and binary state space, wher作者: Eulogy 時(shí)間: 2025-3-24 14:04 作者: enhance 時(shí)間: 2025-3-24 16:22
Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling, an agent at least once in every unit time period. A simple strategy where the .th agent moves back and forth in a segment of length . patrols the length ., but it has been shown recently that this is not always optimal. Thus a natural question is to determine the smallest . such that a fence of len作者: Peak-Bone-Mass 時(shí)間: 2025-3-24 22:48
Communication, Dynamics, and Renormalization, of graphs over a given set of nodes. The technique is then harnessed to carry out a dynamic form of renormalization for averaging-based systems. This analytical framework allows us to formulate new criteria for ensuring the asymptotic periodicity of diffusive influence systems.作者: 等待 時(shí)間: 2025-3-25 00:47 作者: DEBT 時(shí)間: 2025-3-25 07:00 作者: insular 時(shí)間: 2025-3-25 10:29
Conference proceedings 2015 France, in May 2015..The 30 revised full papers presented were carefully reviewed and selected from 93 submissions and are presented together with 2 invited papers. The papers present original research in the theory and applications of algorithms and computational complexity.作者: 護(hù)航艦 時(shí)間: 2025-3-25 14:16
https://doi.org/10.1007/978-3-319-18173-8Algorithmic game theory; Approximation algorithms; Combinatorial optimization; Combinatorics; Computatio作者: 懶鬼才會(huì)衰弱 時(shí)間: 2025-3-25 16:34
978-3-319-18172-1Springer International Publishing Switzerland 2015作者: Institution 時(shí)間: 2025-3-25 21:46 作者: Irrigate 時(shí)間: 2025-3-26 03:13 作者: Overstate 時(shí)間: 2025-3-26 06:03 作者: 初學(xué)者 時(shí)間: 2025-3-26 08:34
https://doi.org/10.1007/978-3-476-05857-7 section. We consider the cartographic problem to place non-overlapping road labels along the edges so that as many road sections as possible are identified by their name, i.e., covered by a label. We show that this is NP-hard in general, but the problem can be solved in polynomial time if the road map is an embedded tree.作者: Somber 時(shí)間: 2025-3-26 13:29 作者: GLARE 時(shí)間: 2025-3-26 19:35 作者: 固執(zhí)點(diǎn)好 時(shí)間: 2025-3-26 23:59 作者: 耕種 時(shí)間: 2025-3-27 04:58 作者: Adj異類(lèi)的 時(shí)間: 2025-3-27 09:20
Nachgetragen: Erfahrungen mit E-Man,sing. A sensor consumes energy in movement in proportion to distance traveled, and it expends energy per time unit for sensing in direct proportion to its radius raised to a constant exponent. We address the problem of energy efficient coverage. The input consists of the initial locations of the sen作者: 恃強(qiáng)凌弱 時(shí)間: 2025-3-27 13:25
Intuition, E-Man und Drittmittel,two designated vertices?. and?., the goal is to delete as few edges as possible in order to increase the length of the (new) shortest .-path as much as possible. This scenario has been mostly studied from the viewpoint of approximation algorithms and heuristics, while we particularly introduce a par作者: 確定無(wú)疑 時(shí)間: 2025-3-27 16:09
https://doi.org/10.1007/978-3-540-71705-8dge. More precisely, we have a . assigning to each edge . a natural number ., its .. The problem . asks whether there exists an orthogonal drawing such that each edge . has at most . bends. It is known that . is NP-hard if . for every edge .?[.]. On the other hand, . can be solved efficiently if .?[作者: 并排上下 時(shí)間: 2025-3-27 18:36 作者: prolate 時(shí)間: 2025-3-27 23:01
Feldversuche zur Erprobung des Verfahrens, its cliques. We consider the online variant of the clique clustering problem, where the vertices of the input graph arrive one at a time. At each step, the newly arrived vertex forms a singleton clique, and the algorithm can merge any existing cliques in its partitioning into larger cliques, but sp作者: FILLY 時(shí)間: 2025-3-28 04:05 作者: 取之不竭 時(shí)間: 2025-3-28 09:36
The Silver Age of Swedish Education, asynchronous Look-Compute-Move cycles. In one cycle, a robot perceives the current configuration in terms of relative positions of robots and meeting points (Look), decides whether to move toward some direction (Compute), then makes the computed move, eventually (Move). Robots are anonymous and exe作者: 陪審團(tuán)每個(gè)人 時(shí)間: 2025-3-28 14:26
Magnus Henrekson,Johan Wennstr?mof the disk. At any time the robots can move anywhere they choose on the disk, independently of each other, with maximum speed .. The robots can cooperate by exchanging information whenever they meet. We study algorithms for the two robots to minimize the .: the time when . robots reach the exit. In作者: nautical 時(shí)間: 2025-3-28 15:13 作者: Allowance 時(shí)間: 2025-3-28 22:34
The Fregean Notion of an Object,e-width if and only if . is an induced subgraph of the 4-vertex path .. We study the (un)boundedness of the clique-width of graph classes defined by two forbidden induced subgraphs . and .. Prior to our study it was not known whether the number of open cases was finite. We provide a positive answer 作者: Urgency 時(shí)間: 2025-3-29 02:13 作者: Trochlea 時(shí)間: 2025-3-29 05:02
Seeking the Logical Basis of Metaphysics,ntractions for some given integer .? We examine three graph parameters: the chromatic number, clique number and independence number. For each of these graph parameters we show that, when . is part of the input, this problem is polynomial-time solvable on .-free graphs and .-complete as well as .[.]-作者: 一瞥 時(shí)間: 2025-3-29 07:36 作者: 類(lèi)人猿 時(shí)間: 2025-3-29 12:48
https://doi.org/10.1007/978-3-476-05857-7 section. We consider the cartographic problem to place non-overlapping road labels along the edges so that as many road sections as possible are identified by their name, i.e., covered by a label. We show that this is NP-hard in general, but the problem can be solved in polynomial time if the road 作者: 錫箔紙 時(shí)間: 2025-3-29 16:10
https://doi.org/10.1007/978-3-476-05857-7e gap between the optimal offline and online solutions. We present a procedure that transforms a decision tree (adaptive algorithm) into a non-adaptive chain. We prove that this chain achieves at least . times the utility of the decision tree, over a product distribution and binary state space, wher作者: Cultivate 時(shí)間: 2025-3-29 20:09
https://doi.org/10.1007/978-3-476-04535-5e that intersects every set in .. The version of the problem with parity constraints asks for a subset . of size at most . that, in addition to being a hitting set, also satisfies certain parity constraints on the sizes of the intersections of . with each set in the family .. In particular, an odd (作者: 表狀態(tài) 時(shí)間: 2025-3-29 23:52 作者: Radiation 時(shí)間: 2025-3-30 05:29
,“Green” Barrier Coverage with Mobile Sensors,nrestricted. We consider two objective functions. In the first the goal is to minimize the sum of the energy spent by all sensors and in the second the goal is to minimize the maximum energy used by any sensor..We present FPTASs for the problem of minimizing the energy sum with variable radii and fo作者: 偶像 時(shí)間: 2025-3-30 11:50 作者: 滔滔不絕的人 時(shí)間: 2025-3-30 12:48 作者: 你敢命令 時(shí)間: 2025-3-30 20:08 作者: 帶子 時(shí)間: 2025-3-30 21:41 作者: expire 時(shí)間: 2025-3-31 02:54
Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints,oblems in this special case, focusing on a parameterized analysis. We show, for each problem, efficient fixed-parameter tractable algorithms using search trees that are tailor-made to the constraints in question, and also polynomial kernels using sunflower-like arguments in a manner that accounts fo作者: 思考 時(shí)間: 2025-3-31 08:49 作者: anaerobic 時(shí)間: 2025-3-31 13:06 作者: CHYME 時(shí)間: 2025-3-31 13:41 作者: expdient 時(shí)間: 2025-3-31 18:52 作者: 愛(ài)哭 時(shí)間: 2025-3-31 22:10
The Fregean Notion of an Object,y of graphs . as subgraphs, minors and topological minors, respectively, and completely determine which of these classes have bounded clique-width. Finally, we show algorithmic consequences of our results for the graph colouring problem restricted to .-free graphs.作者: 擴(kuò)張 時(shí)間: 2025-4-1 03:28
