作者: 后退 時間: 2025-3-21 21:28
Covering with Clubs: Complexity and Approximability,overing . with the minimum number of 3-clubs is not approximable within factor ., for any .. On the positive side, we give an approximation algorithm of factor . for covering a graph with the minimum number of 2-clubs.作者: effrontery 時間: 2025-3-22 03:09 作者: Synapse 時間: 2025-3-22 06:59
Six Modern Authors and Problems of Beliefh partition in .. Thus we show that any algorithm, that can produce a .-approximation for L-graph, would produce a .-approximation for .. We show that unit L-graphs intersected by an axis-parallel line is Co-comparable. For this problem, we propose an algorithm for finding MIS that runs in . time an作者: 四牛在彎曲 時間: 2025-3-22 12:14 作者: rectocele 時間: 2025-3-22 15:33 作者: rectocele 時間: 2025-3-22 18:07
Six Modern Authors and Problems of Belieffined directed rectilinear path. Our objective (.) is to find the maximum number of vehicles that can move without collision. . is shown to be NP-Hard by Ajaykumar et al. [.]. It was also shown that the approximation of this problem is as hard as Maximum Independent Set problem (.) even if the paths作者: 消息靈通 時間: 2025-3-23 00:49 作者: 緊張過度 時間: 2025-3-23 04:17 作者: Bombast 時間: 2025-3-23 07:10
https://doi.org/10.1007/978-1-349-25800-0 in the set invalidates the entire aggregate, giving no information on which signatures are valid. Hartung et al. (PKC 2016) proposed a fault-tolerant aggregate signature scheme based on combinatorial group testing. Given a bound . on the number of invalid signatures, the scheme can determine which 作者: 大門在匯總 時間: 2025-3-23 11:16 作者: 善于騙人 時間: 2025-3-23 14:49
https://doi.org/10.1007/978-1-349-25800-0k, and consider the problem of locating a set of . sinks on a dynamic flow path network with . vertices, where people are located, that minimizes the sum of the evacuation times of all evacuees. Our minsum model is more difficult to deal with than the minmax model, because the cost function is not m作者: BROOK 時間: 2025-3-23 20:07 作者: anchor 時間: 2025-3-24 01:06
https://doi.org/10.1007/978-1-349-26945-7 algorithm is known for . parameterized by the size of the pattern . [Guillemot and Marx 2014], the high complexity of this algorithm makes it impractical for most instances. In this paper we approach the PP problem from .-track permutations, . those permutations that are the union of . increasing p作者: HALO 時間: 2025-3-24 05:28 作者: CRAFT 時間: 2025-3-24 08:36
https://doi.org/10.1007/978-3-540-85138-7edding. A graph is called 1-planar if it can be drawn in the plane with at most one crossing per edge. Our algorithm recursively reduces a 1-planar graph to at most . planar graphs, using edge removal and node contraction. The . problem is then solved on the planar graphs using established polynomia作者: 先鋒派 時間: 2025-3-24 13:00
Helge Toutenburg,Philipp Kn?felsed, a notable example being .-club, which is a subgraph where each vertex is at distance at most . to the others. Here we consider the problem of covering a given graph with the minimum number of .-clubs. We study the computational and approximation complexity of this problem, when . is equal to 2 作者: Myofibrils 時間: 2025-3-24 14:59 作者: BLUSH 時間: 2025-3-24 19:45 作者: 盲信者 時間: 2025-3-25 00:29 作者: micronutrients 時間: 2025-3-25 05:38 作者: orient 時間: 2025-3-25 07:33 作者: dyspareunia 時間: 2025-3-25 12:05
Helge Toutenburg,Philipp Kn?fele “closest” permutation to the given set under the Kendall-tau distance. Since the complexity of this problem is still unknown for sets of 3 permutations, in the following work, we investigate this specific case and show an interesting link with the 3-Hitting Set problem.作者: Small-Intestine 時間: 2025-3-25 19:03
Linear Ramsey Numbers,ndependent set of size .. We say that Ramsey number is . in . if there is a constant . such that . for all .,?.. In the present paper we conjecture that Ramsey number is linear in . if and only if the co-chromatic number is bounded in . and determine Ramsey numbers for several classes of graphs that verify the conjecture.作者: incredulity 時間: 2025-3-25 22:45 作者: 有偏見 時間: 2025-3-26 02:16
Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem,e “closest” permutation to the given set under the Kendall-tau distance. Since the complexity of this problem is still unknown for sets of 3 permutations, in the following work, we investigate this specific case and show an interesting link with the 3-Hitting Set problem.作者: allude 時間: 2025-3-26 04:48 作者: Outshine 時間: 2025-3-26 09:11 作者: Altitude 時間: 2025-3-26 16:32
https://doi.org/10.1007/978-3-540-85138-7stimate of the expected number of distinct palindromic factors in a random word for a memoryless source, where each letter is generated independently from the other, according to some fixed probability distribution on the alphabet.作者: 殘暴 時間: 2025-3-26 18:32
Helge Toutenburg,Philipp Kn?fele “closest” permutation to the given set under the Kendall-tau distance. Since the complexity of this problem is still unknown for sets of 3 permutations, in the following work, we investigate this specific case and show an interesting link with the 3-Hitting Set problem.作者: 土坯 時間: 2025-3-26 22:06 作者: 共棲 時間: 2025-3-27 02:50
Helge Toutenburg,Philipp Kn?felWe prove that every .-node ternary tree has a planar straight-line orthogonal drawing in . area, improving upon the previously best known . bound. Further, we present an upper bound, the outcomes of an experimental evaluation, and a conjecture on the area requirements of planar straight-line orthogonal drawings of complete ternary trees.作者: Brain-Imaging 時間: 2025-3-27 08:35
Linear Clique-Width of Bi-complement Reducible Graphs,We prove that in the class of bi-complement reducible graphs linear clique-width is unbounded and show that this class contains exactly two minimal hereditary subclasses of unbounded linear clique-width.作者: 的’ 時間: 2025-3-27 13:13 作者: Circumscribe 時間: 2025-3-27 16:24
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229879.jpg作者: 使習慣于 時間: 2025-3-27 18:00 作者: overrule 時間: 2025-3-28 01:25 作者: deactivate 時間: 2025-3-28 02:32 作者: 改進 時間: 2025-3-28 06:27 作者: evaculate 時間: 2025-3-28 10:31 作者: 征稅 時間: 2025-3-28 15:02 作者: Overstate 時間: 2025-3-28 19:37 作者: 愚笨 時間: 2025-3-29 00:24
Minsum ,-Sink Problem on Dynamic Flow Path Networks,k, and consider the problem of locating a set of . sinks on a dynamic flow path network with . vertices, where people are located, that minimizes the sum of the evacuation times of all evacuees. Our minsum model is more difficult to deal with than the minmax model, because the cost function is not m作者: seroma 時間: 2025-3-29 06:39
Fully Leafed Induced Subtrees, We study the associated optimization problem, that consists in computing the maximal number of leaves, denoted by ., realized by an induced subtree with . vertices, for .. We begin by proving that the . problem is NP-complete in general. Then, we describe a nontrivial branch and bound algorithm tha作者: Jogging 時間: 2025-3-29 08:04 作者: DEMN 時間: 2025-3-29 11:24
Approximation Algorithms for the ,-Hub Center Routing Problem in Parameterized Metric Graphs,, the . .-. problem is to find a spanning subgraph . of . such that (i) any pair of vertices in . is adjacent in . where . and .; (ii) any pair of vertices in . is not adjacent in .; (iii) each . is adjacent to exactly one vertex in .; and (iv) the routing cost . is minimized where . and . are the v作者: APRON 時間: 2025-3-29 16:08 作者: Infusion 時間: 2025-3-29 20:07 作者: 折磨 時間: 2025-3-30 00:13
On the Expected Number of Distinct Gapped Palindromic Factors,stimate of the expected number of distinct palindromic factors in a random word for a memoryless source, where each letter is generated independently from the other, according to some fixed probability distribution on the alphabet.作者: 細微差別 時間: 2025-3-30 07:06 作者: 推測 時間: 2025-3-30 11:06
Evaluation of Tie-Breaking and Parameter Ordering for the IPO Family of Algorithms Used in Coveringking behavior or parameter ordering can have major impact on the quality of the resulting arrays but have so far not been studied in a systematic manner. In this paper, we survey and present a general framework for the IPO family of algorithms (i.e. IPOG, IPOG-F and IPOG-F2) and present ways to inst作者: SOW 時間: 2025-3-30 14:19 作者: Favorable 時間: 2025-3-30 20:35
An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest,each associated with a penalty, arrives online. OPC-NWSF asks to construct a subgraph . such that each pair . is either connected (there is a path between . and . in .) or its associated penalty is paid. The goal is to minimize the weight of . and the total penalties paid. The current best result fo作者: 導師 時間: 2025-3-30 20:48
Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem,e “closest” permutation to the given set under the Kendall-tau distance. Since the complexity of this problem is still unknown for sets of 3 permutations, in the following work, we investigate this specific case and show an interesting link with the 3-Hitting Set problem.作者: Airtight 時間: 2025-3-31 04:44
https://doi.org/10.1007/978-3-540-85138-7l-time algorithms. We show that a maximum cut in the given 1-planar graph can be derived from the solutions for the planar graphs. Our algorithm computes a maximum cut in an embedded 1-planar graph with . nodes and . edge crossings in time ..作者: expository 時間: 2025-3-31 06:34 作者: 包裹 時間: 2025-3-31 12:35
0302-9743 held in Singapore, Singapore, in July 2018. The 31 regular papers presented in this volume were carefully reviewed and selected from 69 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, cryptography and 作者: Foolproof 時間: 2025-3-31 13:47 作者: Apogee 時間: 2025-3-31 17:38
Six Restoration and French Neoclassic Playsith . vertices, for .. We begin by proving that the . problem is NP-complete in general. Then, we describe a nontrivial branch and bound algorithm that computes the function . for any simple graph .. In the special case where . is a tree of maximum degree ., we provide a . time and . space algorithm to compute the function ..
