標(biāo)題: Titlebook: Combinatorial Optimization and Applications; 12th International C Donghyun Kim,R. N. Uma,Alexander Zelikovsky Conference proceedings 2018 S [打印本頁(yè)] 作者: Aggrief 時(shí)間: 2025-3-21 16:50
書(shū)目名稱(chēng)Combinatorial Optimization and Applications影響因子(影響力)
書(shū)目名稱(chēng)Combinatorial Optimization and Applications影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Combinatorial Optimization and Applications網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Combinatorial Optimization and Applications網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Combinatorial Optimization and Applications被引頻次
書(shū)目名稱(chēng)Combinatorial Optimization and Applications被引頻次學(xué)科排名
書(shū)目名稱(chēng)Combinatorial Optimization and Applications年度引用
書(shū)目名稱(chēng)Combinatorial Optimization and Applications年度引用學(xué)科排名
書(shū)目名稱(chēng)Combinatorial Optimization and Applications讀者反饋
書(shū)目名稱(chēng)Combinatorial Optimization and Applications讀者反饋學(xué)科排名
作者: 織布機(jī) 時(shí)間: 2025-3-21 21:52 作者: circumvent 時(shí)間: 2025-3-22 02:09 作者: LUDE 時(shí)間: 2025-3-22 06:33
Tree ,-Spanners of a Graph: Minimizing Maximum Distances Efficientlyich . has a tree .-spanner is the tree stretch index. The problem of determining the tree stretch index has been studied by: establishing lower and upper bounds, based, for instance, on the girth value and on the minimum diameter spanning tree problem, respectively; and presenting some classes for w作者: AMOR 時(shí)間: 2025-3-22 10:42 作者: 連累 時(shí)間: 2025-3-22 15:08
Directed Path-Width of Sequence Digraphsses called sequence digraphs, such that for each of these classes the directed path-width can be computed in polynomial time. For this purpose we define the graph classes . as the set of all digraphs . which can be defined by . sequences with at most . entries from ., such that . if and only if in o作者: 連累 時(shí)間: 2025-3-22 17:34 作者: Respond 時(shí)間: 2025-3-22 21:19
Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph Problempartial subgraph with maximum number of edges and spectral radius bounded above by .. A software-defined network (SDN) capable of real-time topology reconfiguration can then use an algorithm for finding such subgraph to quickly remove spreading malware threats without deploying specific security cou作者: 全神貫注于 時(shí)間: 2025-3-23 02:17 作者: 細(xì)胞學(xué) 時(shí)間: 2025-3-23 06:19 作者: hurricane 時(shí)間: 2025-3-23 09:50 作者: CORE 時(shí)間: 2025-3-23 14:59
Computing a Rectilinear Shortest Path amid Splinegons in Planemputing a rectilinear shortest path between two points in the polygonal domain. Our reduction algorithm defines a polygonal domain . from . by identifying a coreset of points on the boundaries of splinegons in .. Further, it transforms a shortest path between . and . amid polygonal obstacles in . to作者: Mitigate 時(shí)間: 2025-3-23 20:09
Graph Problems with Obligationstices (resp. of its edges). Now, any solution . containing an element (vertex or edge) of a part of this partition must also contain all the others ones. In other words, elements can only be added set by set, instead of one by one as in the classical situation (corresponding to obligations that are 作者: Genteel 時(shí)間: 2025-3-24 01:42 作者: 土坯 時(shí)間: 2025-3-24 05:30
Removing Undesirable Flows by Edge Deletionr of the malicious flows, but it also inadvertently removes some of the desired flows. To model this important problem, we formulate two problems: (1) remove all the undesirable flows while minimizing the damage to the desirable ones and (2) balance removing the undesirable flows and not removing to作者: 金絲雀 時(shí)間: 2025-3-24 09:34 作者: Compassionate 時(shí)間: 2025-3-24 13:26
Practical and Easy-to-Understand Card-Based Implementation of Yao’s Millionaire Protocolthe actual amounts of their properties. In this paper, we present a simple and practical implementation of Yao’s millionaire protocol using a deck of playing cards; we straightforwardly implement the idea behind Yao’s millionaire protocol so that even non-experts can easily understand its correctnes作者: Synchronism 時(shí)間: 2025-3-24 16:34 作者: 破裂 時(shí)間: 2025-3-24 23:01
Generating Algebraic Expressions for Labeled Grid Graphsthods to a square grid graph in which the number of rows is equal to the number of columns. We prove that the lengths of the expressions derived by the methods depend exponentially and quasi-polynomially, respectively, on the size of the graph.作者: MIRTH 時(shí)間: 2025-3-25 02:48
Graph Problems with Obligationssingletons). A motivation is to give a general framework and to study the complexity of combinatorial problems coming from systems where elements are interdependent. We propose hardness and approximation results.作者: 結(jié)束 時(shí)間: 2025-3-25 03:45 作者: 尊重 時(shí)間: 2025-3-25 09:23 作者: 脫落 時(shí)間: 2025-3-25 14:13
Fast Approximation of Centrality and Distances in Hyperbolic Graphse, where . is a small constant. Recent empirical studies show that many real-world graphs (including Internet application networks, web networks, collaboration networks, social networks, biological networks, and others) have small hyperbolicity.作者: 獨(dú)裁政府 時(shí)間: 2025-3-25 19:51 作者: 致命 時(shí)間: 2025-3-25 21:52
Conference proceedings 2018ions. The papers?cover most aspects of t graph algorithms, routing and network design problems, scheduling algorithms, network optimization, combinatorial algorithms, approximation algorithms, paths and connectivity problems and much more.?.作者: monogamy 時(shí)間: 2025-3-26 00:49 作者: 柔軟 時(shí)間: 2025-3-26 07:48 作者: ROOF 時(shí)間: 2025-3-26 11:00
Schahram Dustdar,Stefan Nasti?,Ognjen ??eki?thods to a square grid graph in which the number of rows is equal to the number of columns. We prove that the lengths of the expressions derived by the methods depend exponentially and quasi-polynomially, respectively, on the size of the graph.作者: arthroplasty 時(shí)間: 2025-3-26 16:13
Schahram Dustdar,Stefan Nasti?,Ognjen ??eki?singletons). A motivation is to give a general framework and to study the complexity of combinatorial problems coming from systems where elements are interdependent. We propose hardness and approximation results.作者: Pseudoephedrine 時(shí)間: 2025-3-26 16:51 作者: SIT 時(shí)間: 2025-3-27 00:36 作者: 紅腫 時(shí)間: 2025-3-27 04:03
Jamal Toutouh,Javier Luque,Enrique Albae .-degenerate induced subgraph enumeration. The time complexity is . time per solution with polynomial preprocessing time and the space complexity is linear in the input graph size, where . and . are the maximum degree and the degeneracy of the input graph.作者: 使虛弱 時(shí)間: 2025-3-27 05:50 作者: 得罪 時(shí)間: 2025-3-27 10:34
Sergio Nesmachnow,Luis Hernández Callejonodes. We combine this algorithm with a maximum matching algorithm to obtain a . approximation algorithm for all values of .. We also describe how the mathematical programming formulation we give has several advantages over previous approaches which attempted at finding a subgraph with minimum spectral radius given an edge removal budget.作者: emulsify 時(shí)間: 2025-3-27 17:01
Schahram Dustdar,Stefan Nasti?,Ognjen ??eki?oblem is .[1]-hard, in parameter ., where . is the number of edge operations and . is the number of vertices to be satisfied. We also show that it is inapproximable to within a factor of .. For certain relaxations of the max-degree constraints, we are able to show constant-factor approximation algorithms for the problem.作者: PHON 時(shí)間: 2025-3-27 19:20 作者: GAVEL 時(shí)間: 2025-3-27 21:58
https://doi.org/10.1007/978-3-642-20736-5ttack (for example, he/she could exchange some of the cards stealthily when doing such a private action). In contrast, our implementation relies on a familiar shuffling operation called a random cut, and hence, it can be conducted completely publicly so as to avoid any active attack.作者: 不容置疑 時(shí)間: 2025-3-28 04:05 作者: prosperity 時(shí)間: 2025-3-28 07:48 作者: travail 時(shí)間: 2025-3-28 12:10
Directed Path-Width of Sequence Digraphs time ., where . denotes the maximum sequence length. This leads to an XP-algorithm w.r.t. . for the directed path-width problem. As most known parameterized algorithms for directed path-width consider the standard parameter, our algorithm improves significantly the known results for a high amount of digraphs of large directed path-width.作者: narcotic 時(shí)間: 2025-3-28 17:10
Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph Problemnodes. We combine this algorithm with a maximum matching algorithm to obtain a . approximation algorithm for all values of .. We also describe how the mathematical programming formulation we give has several advantages over previous approaches which attempted at finding a subgraph with minimum spectral radius given an edge removal budget.作者: sed-rate 時(shí)間: 2025-3-28 19:15 作者: AER 時(shí)間: 2025-3-29 02:03
Bipartizing with a Matchingets, and?.-free graphs. Additionally, we show that this problem is fixed-parameter tractable when parameterized by the clique-width, which implies that it is polynomial-time solvable for many interesting graph classes, such as distance-hereditary, outerplanar, and chordal graphs.作者: jungle 時(shí)間: 2025-3-29 04:08
Practical and Easy-to-Understand Card-Based Implementation of Yao’s Millionaire Protocolttack (for example, he/she could exchange some of the cards stealthily when doing such a private action). In contrast, our implementation relies on a familiar shuffling operation called a random cut, and hence, it can be conducted completely publicly so as to avoid any active attack.作者: 繁榮地區(qū) 時(shí)間: 2025-3-29 07:41 作者: 樹(shù)膠 時(shí)間: 2025-3-29 11:23
Combinatorial Optimization and Applications978-3-030-04651-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: etiquette 時(shí)間: 2025-3-29 16:45
https://doi.org/10.1007/978-3-030-69136-3lution graphs may contain branchings and, thus, they may not be uniquely convertible into sequences. Having introduced various ways of extracting the unique parts of such solutions, we extend previously known NP-hardness results to the case that the solution graph is planar, bipartite, and subcubic, and show that there is no PTAS in this case.作者: 不來(lái) 時(shí)間: 2025-3-29 20:09
https://doi.org/10.1007/978-3-030-04651-4approximation algorithms; computational geometry; data mining; data security; graph theory; heuristic met作者: Deceit 時(shí)間: 2025-3-30 03:07 作者: Tdd526 時(shí)間: 2025-3-30 05:52 作者: Inveterate 時(shí)間: 2025-3-30 08:40
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229974.jpg作者: 相信 時(shí)間: 2025-3-30 16:08 作者: Licentious 時(shí)間: 2025-3-30 19:16 作者: collateral 時(shí)間: 2025-3-30 23:13 作者: Synthesize 時(shí)間: 2025-3-31 03:36
https://doi.org/10.1007/978-3-030-12804-3ich . has a tree .-spanner is the tree stretch index. The problem of determining the tree stretch index has been studied by: establishing lower and upper bounds, based, for instance, on the girth value and on the minimum diameter spanning tree problem, respectively; and presenting some classes for w作者: cutlery 時(shí)間: 2025-3-31 06:17
Sergio Nesmachnow,Luis Hernández Callejod . pairs of vertices that each represent a . from a source to a destination. The goal is to find a path and delay for each demand so that no two trips occupy the same vertex ., and so that the sum of trip times is minimized. We show that even for DAGs with max degree ., Time Disjoint Walks is APX-h作者: incision 時(shí)間: 2025-3-31 10:00
Silvina Hipogrosso,Sergio Nesmachnowses called sequence digraphs, such that for each of these classes the directed path-width can be computed in polynomial time. For this purpose we define the graph classes . as the set of all digraphs . which can be defined by . sequences with at most . entries from ., such that . if and only if in o作者: 民間傳說(shuō) 時(shí)間: 2025-3-31 13:52
https://doi.org/10.1007/978-3-030-69136-3lution graphs may contain branchings and, thus, they may not be uniquely convertible into sequences. Having introduced various ways of extracting the unique parts of such solutions, we extend previously known NP-hardness results to the case that the solution graph is planar, bipartite, and subcubic,作者: 極大痛苦 時(shí)間: 2025-3-31 17:49
