標(biāo)題: Titlebook: Combinatorial Optimization and Applications; 10th International C T-H. Hubert Chan,Minming Li,Lusheng Wang Conference proceedings 2016 Spri [打印本頁(yè)] 作者: sulfonylureas 時(shí)間: 2025-3-21 19:59
書(shū)目名稱Combinatorial Optimization and Applications影響因子(影響力)
書(shū)目名稱Combinatorial Optimization and Applications影響因子(影響力)學(xué)科排名
書(shū)目名稱Combinatorial Optimization and Applications網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Combinatorial Optimization and Applications網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Combinatorial Optimization and Applications被引頻次
書(shū)目名稱Combinatorial Optimization and Applications被引頻次學(xué)科排名
書(shū)目名稱Combinatorial Optimization and Applications年度引用
書(shū)目名稱Combinatorial Optimization and Applications年度引用學(xué)科排名
書(shū)目名稱Combinatorial Optimization and Applications讀者反饋
書(shū)目名稱Combinatorial Optimization and Applications讀者反饋學(xué)科排名
作者: 谷物 時(shí)間: 2025-3-21 21:06 作者: grieve 時(shí)間: 2025-3-22 02:17 作者: Credence 時(shí)間: 2025-3-22 08:16 作者: custody 時(shí)間: 2025-3-22 09:42 作者: canvass 時(shí)間: 2025-3-22 14:17 作者: canvass 時(shí)間: 2025-3-22 19:12 作者: 數(shù)量 時(shí)間: 2025-3-23 00:37
G. A. Persoon,H. Heuveling van Beekmotivated by applications in social network analysis. In this paper we investigate how the complexity of the problem depends on graph parameters (distance from disjoint paths and size of vertex cover), and that is not FPT-approximable. Moreover, we introduce a new variant of the problem, called ., w作者: 同步信息 時(shí)間: 2025-3-23 03:04 作者: pacific 時(shí)間: 2025-3-23 07:59 作者: enflame 時(shí)間: 2025-3-23 10:00
Promoting Non-Farm Skills and Knowledge, a model that was introduced by Dyer, Yang and Ya?ar in 2008. We provide lower bounds and upper bounds on the fast search number (i.e., the minimum number of searchers required for capturing the fugitive) of complete .-partite graphs. We also investigate some special classes of complete .-partite gr作者: esthetician 時(shí)間: 2025-3-23 17:00 作者: forecast 時(shí)間: 2025-3-23 19:50
The Mathematical Model Introduction,d a . subgraph . maximizing ., where . is said to be feasible if for each ., . or .. In the weighted version of the problem, additionally each edge . has a weight .(.) and we want to find a feasible subgraph . maximizing .. The problem is already NP-hard if . for all . [Zhang, FAW-AAIM 2012]..In thi作者: CIS 時(shí)間: 2025-3-23 23:45 作者: Immortal 時(shí)間: 2025-3-24 04:44
Smalltalk and Object Orientationties) of minimum eccentricity in a graph. It was introduced by Dragan and Leitert?[.] who described a linear-time algorithm which is an 8-approximation of the problem. In this paper, we study deeper the double-BFS procedure used in that algorithm and extend it to obtain a linear-time 3-approximation作者: 褪色 時(shí)間: 2025-3-24 09:47
Object Oriented Analysis and Designs a set of nodes of .. For two nodes . and . in ., they can be . by some query . in ., iff exactly one of them belongs to .(.). Then, given a tree ., a query class ., and two disjoint node sets . and . of ., a subtree . of . is called . of ., iff (1) . contains all nodes in ., (2) for any node pair 作者: 弄皺 時(shí)間: 2025-3-24 13:43
John Hunt BSc, PhD, MBCS, C.Engdge of . between . and .. In this paper, we show that a minimum safe set can be found in polynomial time for trees. We then further extend the result and present polynomial-time algorithms for graphs of bounded treewidth, and also for interval graphs. We also study the parameterized complexity of th作者: expdient 時(shí)間: 2025-3-24 16:35
https://doi.org/10.1007/978-3-319-48749-6combinatorial optimization; computational complexity; dynamic programming; game theory; integer programm作者: Measured 時(shí)間: 2025-3-24 19:50
978-3-319-48748-9Springer International Publishing AG 2016作者: 法官 時(shí)間: 2025-3-25 03:07 作者: stroke 時(shí)間: 2025-3-25 04:55 作者: 蒸發(fā) 時(shí)間: 2025-3-25 07:53 作者: Monotonous 時(shí)間: 2025-3-25 15:30 作者: Vsd168 時(shí)間: 2025-3-25 16:24
Combinatorial Optimization and Applications978-3-319-48749-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 散步 時(shí)間: 2025-3-25 22:07
https://doi.org/10.1007/978-94-017-3008-2quires at most three cops, we study the capture time of a planar graph . of . vertices using three cops, which is denoted by .. We present a new capture strategy and show that .. This is the first result on ..作者: 心胸開(kāi)闊 時(shí)間: 2025-3-26 03:29
On the Capture Time of Cops and Robbers Game on a Planar Graphquires at most three cops, we study the capture time of a planar graph . of . vertices using three cops, which is denoted by .. We present a new capture strategy and show that .. This is the first result on ..作者: Budget 時(shí)間: 2025-3-26 07:54
Conference proceedings 2016in Hong Kong, China, in December 2016...The 60 full papers included in the book were carefully reviewed and selected from 122 submissions. The papers are organized in topical sections such as graph theory, geometric optimization, complexity and data structure, combinatorial optimization, and miscellaneous..作者: 取消 時(shí)間: 2025-3-26 11:09 作者: 文藝 時(shí)間: 2025-3-26 16:32
The Mathematical Model Introduction,ving the result of Aurora et al. [FAW-AAIM 2013] who presented an .-approximation for the weighted case..We also present a PTAS for .-minor free graphs, if the demands on the edges are bounded above by a constant, and we show that the problem is APX-hard even for cubic graphs and bounded degree bipartite graphs with ..作者: HALL 時(shí)間: 2025-3-26 17:09 作者: esthetician 時(shí)間: 2025-3-26 22:23
Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks a regularization procedure that transforms a given graph with maximum degree?. into a .-regular graph with the same clique number by adding at most . new nodes. This is of independent interest because it implies that finding a maximum clique in a regular graph is .-hard to approximate to within a factor of . for all ..作者: gratify 時(shí)間: 2025-3-27 02:17
Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problemving the result of Aurora et al. [FAW-AAIM 2013] who presented an .-approximation for the weighted case..We also present a PTAS for .-minor free graphs, if the demands on the edges are bounded above by a constant, and we show that the problem is APX-hard even for cubic graphs and bounded degree bipartite graphs with ..作者: mortgage 時(shí)間: 2025-3-27 08:46
On the Complexity of Extracting Subtree with Keeping Distinguishabilityhether there is a small enough subtree . of ., such that for query class . and node sets . and ., . preserves the . of .. In this paper, as an initial attempt of investigating this problem, fixing . to be a specific part of . (introduced later), the subtree extraction problem is shown to be NP-..作者: Cytology 時(shí)間: 2025-3-27 09:44 作者: pantomime 時(shí)間: 2025-3-27 16:23
Conclusion: Connecting the Dots, leads to simultaneous broadcasting of optimal number of messages on a wide class of graphs in optimal time. In particular, we provide tight results for bipartite tori, meshes, hypercubes. Several problems and conjectures are proposed.作者: 愛(ài)花花兒憤怒 時(shí)間: 2025-3-27 17:56 作者: GRAIN 時(shí)間: 2025-3-27 22:59 作者: Amorous 時(shí)間: 2025-3-28 05:55 作者: Facet-Joints 時(shí)間: 2025-3-28 08:36
An Introduction to Coding Sequences of Graphsinary matroids, we obtain a characterization for simple graphic matroids. Introducing concepts of segment binary matroid and strong isomorphisms we show that two simple undirected graphs are isomorphic if and only if their canonical sequences are strongly isomorphic simple segment binary matroids... 05C62, 05C50, 05B35.作者: 配偶 時(shí)間: 2025-3-28 13:14
Approximation and Hardness Results for the Max ,-Uncut Problemroximation algorithm, and an .-approximation algorithm by reducing it to ., where . is the approximation ratio for the . problem. More importantly, we show that . and . are in fact equivalent in approximability up?to a factor of 2. We also prove a weak approximation hardness result for . under the assumption ..作者: LIEN 時(shí)間: 2025-3-28 15:17
Computing a Tree Having a Small Vertex Coverhard to achieve an .-approximation for the problem with general graphs. In this paper, we present constant-factor approximation algorithms for the problem with unit disk graphs and with graphs excluding a fixed minor.作者: 停止償付 時(shí)間: 2025-3-28 18:48
On the Approximability of ,ed fixed-cardinality maximization problem . that aims at maximizing the number of equivalence classes induced by a solution set of . vertices. We study the approximation complexity of . on general hypergraphs and on more restricted instances, in particular, neighborhood hypergraphs of graphs.作者: 我不怕?tīng)奚?nbsp; 時(shí)間: 2025-3-29 00:13
Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysishose goal is to find the maximum number of vertex-disjoint and color-disjoint uni-color paths. We extend some of the results of . to this new variant, and we prove that unlike ., . is already hard on graphs at distance two from disjoint paths.作者: Insulin 時(shí)間: 2025-3-29 06:14
Fast Searching on Complete ,-partite Graphsaphs, such as complete bipartite graphs and complete split graphs. We solve the open problem of determining the fast search number of complete bipartite graphs, and present upper and lower bounds on the fast search number of complete split graphs.作者: 最低點(diǎn) 時(shí)間: 2025-3-29 07:42 作者: 變量 時(shí)間: 2025-3-29 12:01 作者: Outmoded 時(shí)間: 2025-3-29 15:56
John Hunt BSc, PhD, MBCS, C.Engand present polynomial-time algorithms for graphs of bounded treewidth, and also for interval graphs. We also study the parameterized complexity of the problem. We show that the problem is fixed-parameter tractable when parameterized by the solution size. Furthermore, we show that this parameter lies between tree-depth and vertex cover number.作者: 厭倦嗎你 時(shí)間: 2025-3-29 19:59
Safe Sets in Graphs: Graph Classes and Structural Parametersand present polynomial-time algorithms for graphs of bounded treewidth, and also for interval graphs. We also study the parameterized complexity of the problem. We show that the problem is fixed-parameter tractable when parameterized by the solution size. Furthermore, we show that this parameter lies between tree-depth and vertex cover number.作者: Exposure 時(shí)間: 2025-3-30 02:11
0302-9743 selected from 122 submissions. The papers are organized in topical sections such as graph theory, geometric optimization, complexity and data structure, combinatorial optimization, and miscellaneous..978-3-319-48748-9978-3-319-48749-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: JOT 時(shí)間: 2025-3-30 06:04
Smaller Satellites: Bigger Business?roximation algorithm, and an .-approximation algorithm by reducing it to ., where . is the approximation ratio for the . problem. More importantly, we show that . and . are in fact equivalent in approximability up?to a factor of 2. We also prove a weak approximation hardness result for . under the assumption ..作者: intertwine 時(shí)間: 2025-3-30 10:01 作者: ellagic-acid 時(shí)間: 2025-3-30 16:25
Smaller Satellites: Bigger Business?ed fixed-cardinality maximization problem . that aims at maximizing the number of equivalence classes induced by a solution set of . vertices. We study the approximation complexity of . on general hypergraphs and on more restricted instances, in particular, neighborhood hypergraphs of graphs.作者: ear-canal 時(shí)間: 2025-3-30 18:27 作者: ASTER 時(shí)間: 2025-3-31 00:31 作者: Folklore 時(shí)間: 2025-3-31 04:12
Smalltalk and Object Orientation algorithm. We moreover study the link between the MESP problem and the notion of laminarity, introduced by V?lkel . [.], corresponding to its restriction to a diameter (. a shortest path of maximum length), and show tight bounds between MESP and laminarity parameters.作者: sterilization 時(shí)間: 2025-3-31 07:43 作者: Liability 時(shí)間: 2025-3-31 10:57
PROBA (Project for On-board Autonomy)arge, and also prove the polynomial-time solvability and computational hardness of its variants with integer constraints. In the second part, we apply our model to the case study of Minabe town in Wakayama prefecture, Japan.作者: Infirm 時(shí)間: 2025-3-31 14:18 作者: hemorrhage 時(shí)間: 2025-3-31 19:26
Vongpaphane Manivong,R. A. Crambhe total dual integrality of system ., as well as those for the (stronger) total unimodularity of matrix . and the (weaker) integrality of polyhedron .. These necessary conditions are shown to be sufficient when restricted to planar graphs. We prove that the three notions of integrality coincide, an作者: obstinate 時(shí)間: 2025-4-1 01:24 作者: 梯田 時(shí)間: 2025-4-1 02:53 作者: 高度 時(shí)間: 2025-4-1 06:45
Total Dual Integrality of Triangle Coveringhe total dual integrality of system ., as well as those for the (stronger) total unimodularity of matrix . and the (weaker) integrality of polyhedron .. These necessary conditions are shown to be sufficient when restricted to planar graphs. We prove that the three notions of integrality coincide, an作者: 健忘癥 時(shí)間: 2025-4-1 12:07
