標(biāo)題: Titlebook: Parameterized and Exact Computation; 6th International Sy Dániel Marx,Peter Rossmanith Conference proceedings 2012 Springer-Verlag GmbH Ber [打印本頁(yè)] 作者: 壓榨機(jī) 時(shí)間: 2025-3-21 16:34
書(shū)目名稱(chēng)Parameterized and Exact Computation影響因子(影響力)
書(shū)目名稱(chēng)Parameterized and Exact Computation影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Parameterized and Exact Computation網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Parameterized and Exact Computation網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Parameterized and Exact Computation被引頻次
書(shū)目名稱(chēng)Parameterized and Exact Computation被引頻次學(xué)科排名
書(shū)目名稱(chēng)Parameterized and Exact Computation年度引用
書(shū)目名稱(chēng)Parameterized and Exact Computation年度引用學(xué)科排名
書(shū)目名稱(chēng)Parameterized and Exact Computation讀者反饋
書(shū)目名稱(chēng)Parameterized and Exact Computation讀者反饋學(xué)科排名
作者: 責(zé)問(wèn) 時(shí)間: 2025-3-21 20:29
Finding Good Decompositions for Dynamic Programming on Dense Graphs,mming by tree-width, at least for graphs of edge density above a certain bound. In view of the amount of previous work on heuristics for tree-width these results indicate that boolean-width could in the future outperform tree-width in practice for a large class of graphs and problems.作者: 偽證 時(shí)間: 2025-3-22 03:28 作者: ostracize 時(shí)間: 2025-3-22 07:51
On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal,ement for the treewidth . graphs is necessary. Further lower bounds are given for parameterization by distance from cluster and co-cluster graphs respectively, as well as for . OCT parameterized by the vertex cover number (i.e., the distance from an independent set).作者: artifice 時(shí)間: 2025-3-22 11:40
On Multiway Cut Parameterized above Lower Bounds,hem to be fixed-parameter tractable. Our results imply ..(4.) algorithms for .. and . as well as an ..(2.) algorithm for .. with a standard parameterization by the solution size, improving previous bounds for these problems.作者: Insul島 時(shí)間: 2025-3-22 15:58 作者: 安心地散步 時(shí)間: 2025-3-22 20:59
A Faster Algorithm for Dominating Set Analyzed by the Potential Method, analysis concentrates on one branching at once by using only small number of variables. In this paper, we extend the measure and conquer analysis and introduce a new analyzing technique named “potential method” to deal with consecutive branchings together. In potential method, the optimization prob作者: 孵卵器 時(shí)間: 2025-3-22 23:37 作者: 出價(jià) 時(shí)間: 2025-3-23 03:46
Increasing the Minimum Degree of a Graph by Contractions, following three results. First, . is .-complete even when .?=?14. Second, it is fixed-parameter tractable when parameterized by . and .. Third, it is .[1]-hard when parameterized by .. We also study its variant where the input graph is weighted, i.e., has some edge weighting and the contractions pr作者: 身體萌芽 時(shí)間: 2025-3-23 06:39
Planar Disjoint-Paths Completion,blem can be stated as follows: given a plane graph ., . pairs of terminals, and a face . of ., find a minimum-size set of edges, if one exists, to be added inside . so that the embedding remains planar and the pairs become connected by . disjoint paths in the augmented network. Our results are twofo作者: Flustered 時(shí)間: 2025-3-23 13:36
Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing,linear equations (i.e., where the rows of . are .-sparse) is fixed-parameter tractable (FPT) in the combined parameter .,.. For .?=?2 the problem is simple. For 0,1-matrices . we can also compute an .(..) kernel. For systems of linear inequalities we get an FPT result in the combined parameter .,., 作者: INCH 時(shí)間: 2025-3-23 14:12
New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree,due to Williams) solving them in less than 2. steps uses exponential space. Scott and Sorkin give an algorithm with . time and polynomial space for these problems, where . is the average variable degree. We improve this bound to . for MAX-2-SAT and . for MAX-2-CSP. We also prove stronger upper bound作者: Flu表流動(dòng) 時(shí)間: 2025-3-23 22:04
Improved Parameterized Algorithms for above Average Constraint Satisfaction,e, a simple random assignment for . allows 7/8-approximation and for every .?>?0 there is no polynomial-time (7/8?+?.)-approximation unless P=NP. Another example is the . of bounded arity. Given the expected fraction . of the constraints satisfied by a random assignment (i.e. permutation), there is 作者: Accede 時(shí)間: 2025-3-23 22:13 作者: Apoptosis 時(shí)間: 2025-3-24 03:25
Kernel Bounds for Path and Cycle Problems, and the recent development of techniques for obtaining kernelization lower bounds. This work explores the existence of polynomial kernels for various path and cycle problems, by considering nonstandard parameterizations. We show polynomial kernels when the parameters are a given vertex cover, a mod作者: 打折 時(shí)間: 2025-3-24 09:04 作者: 裙帶關(guān)系 時(shí)間: 2025-3-24 11:09 作者: 繁榮地區(qū) 時(shí)間: 2025-3-24 17:16
Simpler Linear-Time Kernelization for Planar Dominating Set,domination number of ., i.e., the size of a smallest dominating set in?.. In the language of parameterized computation, the new algorithm is a linear-time kernelization for the NP-complete . problem that produces a kernel of linear size. Such an algorithm was previously known (van Bevern et al., the作者: MURAL 時(shí)間: 2025-3-24 20:20
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs,(.)) with?.(.)?=?.(.′). In addition, a minimum dominating set for?. can be inferred from a minimum dominating set for?.′. In terms of parameterized algorithmics, this implies a linear-size problem kernel for the NP-hard . problem on planar graphs, where the kernelization takes linear time. This impr作者: AUGER 時(shí)間: 2025-3-25 03:03 作者: compose 時(shí)間: 2025-3-25 04:09
Parameterized Maximum Path Coloring,ety of reasonable parameters for the problem, such as the maximum degree and treewidth of the network graph, the number of available colors and the number of requests one seeks to satisfy or reject. In an effort to understand the impact of each of these parameters on the problem’s complexity we stud作者: fructose 時(shí)間: 2025-3-25 10:29 作者: Dorsal-Kyphosis 時(shí)間: 2025-3-25 13:56 作者: 感情脆弱 時(shí)間: 2025-3-25 19:02 作者: MENT 時(shí)間: 2025-3-25 21:52
Yoichi Iwata of modularisation and concepts for electrification.IncludesIn chassis development, the three aspects of safety, vehicle dynamics and ride comfort are at the top of the list of challenges to be faced. Addressing this triad of challenges becomes even more complex when the chassis is required to inter作者: insurgent 時(shí)間: 2025-3-26 02:28
Pinar Heggernes,Pim van ’t Hof,Benjamin Lévêque,Daniel Lokshtanov,Christophe Paulg this triad of challenges becomes even more complex when the chassis is required to interact with assistance systems and other systems for fully automated driving. What is more, new demands are created by the introduction of modern electric and electronic architectures. All these requirements must 作者: Flagging 時(shí)間: 2025-3-26 05:26
Peter Damaschkekens doch weit zurück. Erste Ans?tze lassen sich sogar schon bei den Philosophen im antiken Griechenland finden. Im Folgenden wird eine knappe Darstellung der Entwicklung der Volkswirtschaftslehre und der Betriebswirtschaftslehre gegeben. Da hier für eine vollst?ndige übersicht nicht der Raum ist, w作者: excrete 時(shí)間: 2025-3-26 11:25
Alexander Golovnev?ferierte aus: Zum einen über vier Pr?missen, mit denen das Grundverst?ndnis von Zukunft n?her bestimmt wird, zum anderen über eine erste Eingrenzung des analytischen Instrumentariums, das sie nutzt. Dabei geht es im Kern um differenzierte . sowie spezielle . Operationen (wie kann etwas erforscht we作者: Lamina 時(shí)間: 2025-3-26 15:22 作者: 不吉祥的女人 時(shí)間: 2025-3-26 20:22 作者: 木質(zhì) 時(shí)間: 2025-3-26 22:21 作者: NIP 時(shí)間: 2025-3-27 03:49
Hajo Broersma,Petr A. Golovach,Viresh Patel6 um spezielle Grundlagen der linearen Algebra. 1.1 bis 1.3 geh?ren mit ihren zum Teil klassischen Aufgaben (und L?sungen) zur Grundbildung und k?nnten daher einigen unserer LeserInnen, die bereits gewisse Vorkenntnisse haben, bekannt oder sogar gel?ufig sein.作者: 花爭(zhēng)吵 時(shí)間: 2025-3-27 08:00
Eivind Magnus Hvidevold,Sadia Sharmin,Jan Arne Telle,Martin Vatshelle, die sich zum einen mit der . vor dem Hintergrund der ?koeffizienz besch?ftigen, noch zum anderen der . in diesem Zusammenhang begegnen. Folglich versuchte das im Rahmen dieser Arbeit entwickelte betriebsindividuelle ressourcen- und energiebezogene Benchmarksystem am Beispiel der W?schereibranche d作者: dissent 時(shí)間: 2025-3-27 10:37
Michael Lampis6) hinsichtlich der Eignung des im Rahmen der Methodik angewendeten multikriteriellen Bewertungsverfahrens des AHP, sowie methodenspezifischen Charakteristika wie die Ermittlung von Korrekturfaktoren und mathematische Abh?ngigkeiten zwischen den Unterscheidungskriterien diskutiert werden.作者: 令人心醉 時(shí)間: 2025-3-27 16:05 作者: gospel 時(shí)間: 2025-3-27 21:39
