作者: forbid 時(shí)間: 2025-3-21 23:29
https://doi.org/10.1007/978-3-8350-5507-0 .. Roughly speaking, we show that the easy cases one can think of (. when edgeless graphs of the right sizes are in ., or if . contains only cliques) are the only families giving rise to a polynomial problem: all others are .-complete. We then investigate the parameterized complexity of the problem作者: 對(duì)待 時(shí)間: 2025-3-22 03:58 作者: FAZE 時(shí)間: 2025-3-22 06:26
Six Sigma Performance Measurement Systemonal complexity classification results of the compaction problem for such graphs determined earlier by the author. Our results show that the compaction, vertex-compaction, and retraction problems are polynomially equivalent for every graph with four or fewer vertices.作者: Ornament 時(shí)間: 2025-3-22 10:00
On the Parameterized Complexity of?Happy Vertex Coloringtudy the problem . with a different parameterization, which we call .. The problem . takes as an input a graph ., integers . and ., a vertex subset ., and a coloring .. The goal is to decide if there exist a coloring . such that . and ., where . is the set of happy vertices in . with respect to .. W作者: caldron 時(shí)間: 2025-3-22 16:13
Complexity Dichotomies for the Minimum ,-Overlay Problem .. Roughly speaking, we show that the easy cases one can think of (. when edgeless graphs of the right sizes are in ., or if . contains only cliques) are the only families giving rise to a polynomial problem: all others are .-complete. We then investigate the parameterized complexity of the problem作者: caldron 時(shí)間: 2025-3-22 18:52 作者: Iatrogenic 時(shí)間: 2025-3-23 00:13 作者: 玷污 時(shí)間: 2025-3-23 04:53
https://doi.org/10.1007/978-88-470-0700-0numeration of Skolem labellings and related structures. This includes discussion of two constructions of low density parity check codes from Skolem labellings. We raise several pertinent questions and suggestions for future research directions.作者: vitrectomy 時(shí)間: 2025-3-23 06:58 作者: 苦澀 時(shí)間: 2025-3-23 13:24
Six Sigma - Kompakt und praxisnahis easy to see the construction method. We have explored further how a picture is worth ten thousand words..We give variations of the above array to allow for more general matrices than symmetric Williamson propus matrices. One such is the ..作者: 創(chuàng)新 時(shí)間: 2025-3-23 14:05
Improve – Es darf verbessert werdengraph in the plane. Alpert et al. [Electron.?J. Combin., 2009] conjectured that any graph has a . straight-line drawing, that is, a drawing with vertices in convex position, that maximizes the number of edge crossings. We disprove this conjecture by constructing a planar graph on twelve vertices tha作者: synovitis 時(shí)間: 2025-3-23 19:09 作者: 外貌 時(shí)間: 2025-3-23 23:55
https://doi.org/10.1007/978-3-030-31915-1ation of a .-submodular function is NP-hard, and approximation algorithms have been studied. Most of algorithms use randomization and achieve the approximation ratio as the expected value. For unconstrained submodular maximization, [Buchbinder and Feldman 2016] gave a derandomization scheme, and sho作者: Recessive 時(shí)間: 2025-3-24 04:49
Total Six Sigma Kennzahlensystem, same as that of .. The problem . takes as an input a graph ., an integer ., a vertex subset ., and a (partial) coloring . of vertices in .. The goal is to find a coloring . such that ., . . extends the partial coloring . to a coloring of vertices in . and the number of happy vertices in . is maximi作者: 紳士 時(shí)間: 2025-3-24 06:53 作者: 一大塊 時(shí)間: 2025-3-24 11:06
Six Sigma Performance Measurement System. We show that . remains .-hard in planar graphs with degree at most five. This result is extended to bipartite planar graphs with degree at most six. We also show that . is hard to approximate within a factor lower than . in the bipartite case (resp. .), unless ., (resp. under .). We also show that作者: CLEFT 時(shí)間: 2025-3-24 16:03
Six Sigma Performance Measurement Systemrther, an edge (.,?.) is happy if .. Given a partial coloring . of ., the Maximum Happy Vertex (Edge) problem asks for a total coloring of . extending . to all vertices of . that maximizes the number of happy vertices (edges). Both problems are known to be NP-hard in general even when ., and is poly作者: mosque 時(shí)間: 2025-3-24 20:00
Six Sigma Performance Measurement System. The relationships that we present relate to a long-standing open problem concerning whether any pair of these problems are polynomially equivalent for every graph. The relationships we present also relate to the constraint satisfaction problem, providing evidence that similar to the compaction and作者: 紅腫 時(shí)間: 2025-3-25 01:52 作者: 預(yù)感 時(shí)間: 2025-3-25 03:37
https://doi.org/10.1007/978-3-319-78825-8Complexity Theory; Graph Theory; Combinatorics; Combinatorial Optimization; Cryptography; Information Sec作者: cataract 時(shí)間: 2025-3-25 10:19 作者: inveigh 時(shí)間: 2025-3-25 11:59
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229882.jpg作者: EXALT 時(shí)間: 2025-3-25 16:23 作者: 伸展 時(shí)間: 2025-3-25 22:29
https://doi.org/10.1007/978-88-470-0700-0numeration of Skolem labellings and related structures. This includes discussion of two constructions of low density parity check codes from Skolem labellings. We raise several pertinent questions and suggestions for future research directions.作者: 茁壯成長(zhǎng) 時(shí)間: 2025-3-26 03:51
Six Sigma - Kompakt und praxisnahis easy to see the construction method. We have explored further how a picture is worth ten thousand words..We give variations of the above array to allow for more general matrices than symmetric Williamson propus matrices. One such is the ..作者: 改變 時(shí)間: 2025-3-26 06:34
Combinatorial Questions: How Can Graph Labelling Help?numeration of Skolem labellings and related structures. This includes discussion of two constructions of low density parity check codes from Skolem labellings. We raise several pertinent questions and suggestions for future research directions.作者: 承認(rèn) 時(shí)間: 2025-3-26 12:25
A Construction for , Orthogonal Matrices Visualizedis easy to see the construction method. We have explored further how a picture is worth ten thousand words..We give variations of the above array to allow for more general matrices than symmetric Williamson propus matrices. One such is the ..作者: 與野獸博斗者 時(shí)間: 2025-3-26 16:27
https://doi.org/10.1007/978-88-470-0700-0We investigate an entire .-irregularity strength of plane graphs as a modification of the well-known total and entire face irregularity strengths. Estimations on this new graph characteristic are obtained and determined the precise values for graphs from two families of plane graphs to demonstrate that the obtained bounds are tight.作者: 邊緣帶來(lái)墨水 時(shí)間: 2025-3-26 18:22 作者: 誘拐 時(shí)間: 2025-3-26 22:32 作者: Aphorism 時(shí)間: 2025-3-27 04:16 作者: 束縛 時(shí)間: 2025-3-27 09:00 作者: 金絲雀 時(shí)間: 2025-3-27 12:42
Extremal Kernelization: A Commemorative Paperketching further venues how this influence could be even increased in order to obtain quick . classification results. Conversely, we show how certain notions that have become of importance within parameterized algorithmics can be useful to keep in mind for combinatorialists. We hope that this accoun作者: 全神貫注于 時(shí)間: 2025-3-27 16:54
A Construction for , Orthogonal Matrices Visualizedis easy to see the construction method. We have explored further how a picture is worth ten thousand words..We give variations of the above array to allow for more general matrices than symmetric Williamson propus matrices. One such is the ..作者: medieval 時(shí)間: 2025-3-27 19:54 作者: 親密 時(shí)間: 2025-3-27 23:24
Approximation Results for the Incremental Knapsack Problemtain period, it cannot be removed afterwards. The problem calls for maximizing the sum of the profits over the whole time horizon. In this work, we manage to prove the tightness of some approximation ratios of a general purpose algorithm currently available in the literature. We also devise a Polyno作者: 多嘴多舌 時(shí)間: 2025-3-28 02:37
Derandomization for ,-Submodular Maximizationation of a .-submodular function is NP-hard, and approximation algorithms have been studied. Most of algorithms use randomization and achieve the approximation ratio as the expected value. For unconstrained submodular maximization, [Buchbinder and Feldman 2016] gave a derandomization scheme, and sho作者: antecedence 時(shí)間: 2025-3-28 08:04 作者: 分離 時(shí)間: 2025-3-28 12:40
Complexity Dichotomies for the Minimum ,-Overlay Problem by every hyperedge of . contains some member of . as a spanning subgraph. While it is easy to see that the complete graph on |.(.)| overlays . on a hypergraph . whenever the problem admits a solution, the . .-. problem asks for such a graph with the minimum number of edges. This problem allows to g作者: artless 時(shí)間: 2025-3-28 17:58
Improved Complexity for Power Edge Set?Problem. We show that . remains .-hard in planar graphs with degree at most five. This result is extended to bipartite planar graphs with degree at most six. We also show that . is hard to approximate within a factor lower than . in the bipartite case (resp. .), unless ., (resp. under .). We also show that作者: Cervical-Spine 時(shí)間: 2025-3-28 22:12 作者: legitimate 時(shí)間: 2025-3-29 00:18 作者: foliage 時(shí)間: 2025-3-29 03:39
Holes in 2-Convex Point Setsygon with . vertices from?. and no points of?. in its interior. For a positive integer ., a simple polygon?. is . if no straight line intersects the interior of?. in more than . connected components. A point set . is . if there exists an .-convex polygonization of ...Considering a typical Erd?s–Szek作者: 使混合 時(shí)間: 2025-3-29 09:14 作者: OCTO 時(shí)間: 2025-3-29 15:10 作者: Hypomania 時(shí)間: 2025-3-29 18:46
On the Maximum Crossing Numberum number of crossings of a geometric graph and that the weighted geometric case is NP-hard to approximate. We strengthen these results by showing hardness of approximation even for the unweighted geometric case and prove that the unweighted topological case is NP-hard.作者: 量被毀壞 時(shí)間: 2025-3-29 23:27
Approximation Results for the Incremental Knapsack Problemural assumption that each item can be packed in the first time period. For this variant, we discuss different approximation algorithms suited for any number of time periods and provide an algorithm with a constant approximation factor of . for the case with two periods.作者: Control-Group 時(shí)間: 2025-3-30 01:32 作者: Basal-Ganglia 時(shí)間: 2025-3-30 07:22 作者: Climate 時(shí)間: 2025-3-30 09:18 作者: 苦笑 時(shí)間: 2025-3-30 13:20 作者: critique 時(shí)間: 2025-3-30 20:28 作者: 維持 時(shí)間: 2025-3-30 21:20 作者: Contend 時(shí)間: 2025-3-31 01:53 作者: 抵消 時(shí)間: 2025-3-31 05:44
