標(biāo)題: Titlebook: Algorithms and Complexity; 7th International Co Tiziana Calamoneri,Josep Diaz Conference proceedings 2010 Springer-Vralg Berlin Heidelberg [打印本頁(yè)] 作者: Johnson 時(shí)間: 2025-3-21 16:30
書(shū)目名稱Algorithms and Complexity影響因子(影響力)
書(shū)目名稱Algorithms and Complexity影響因子(影響力)學(xué)科排名
書(shū)目名稱Algorithms and Complexity網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Algorithms and Complexity網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Algorithms and Complexity被引頻次
書(shū)目名稱Algorithms and Complexity被引頻次學(xué)科排名
書(shū)目名稱Algorithms and Complexity年度引用
書(shū)目名稱Algorithms and Complexity年度引用學(xué)科排名
書(shū)目名稱Algorithms and Complexity讀者反饋
書(shū)目名稱Algorithms and Complexity讀者反饋學(xué)科排名
作者: 有說(shuō)服力 時(shí)間: 2025-3-22 00:00 作者: 前奏曲 時(shí)間: 2025-3-22 04:08 作者: 我還要背著他 時(shí)間: 2025-3-22 04:58 作者: CHECK 時(shí)間: 2025-3-22 08:43
Towards a Distributed Search Enginearch engine while keeping all the benefits of a centralized search engine in spite of the intrinsic network latency imposed by Internet. The key ideas to achieve this goal are layered caching, online prediction mechanisms and exploit the locality and distribution of queries.作者: 返老還童 時(shí)間: 2025-3-22 16:30 作者: 約會(huì) 時(shí)間: 2025-3-22 17:25
https://doi.org/10.1007/978-3-642-13073-1algorithms; approximation; combinatorial optimization; combinatorics; complexity; computational complexit作者: Conquest 時(shí)間: 2025-3-23 00:40 作者: 和音 時(shí)間: 2025-3-23 02:51 作者: 災(zāi)難 時(shí)間: 2025-3-23 07:51 作者: iodides 時(shí)間: 2025-3-23 11:28 作者: 植物群 時(shí)間: 2025-3-23 14:19
Der Kampf um den verlorenen Tag in many areas. Most notably, it has lead to a number of truthful mechanisms that have seen a recent rejuvenation in the context of sponsored search. In this paper we survey the history of these problems and provide several links to ongoing research in the field.作者: 委派 時(shí)間: 2025-3-23 18:45 作者: 消滅 時(shí)間: 2025-3-23 22:55
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153109.jpg作者: 試驗(yàn) 時(shí)間: 2025-3-24 04:31
https://doi.org/10.1007/978-3-658-04447-3arch engine while keeping all the benefits of a centralized search engine in spite of the intrinsic network latency imposed by Internet. The key ideas to achieve this goal are layered caching, online prediction mechanisms and exploit the locality and distribution of queries.作者: cumulative 時(shí)間: 2025-3-24 07:20 作者: 你敢命令 時(shí)間: 2025-3-24 14:10 作者: 貪婪的人 時(shí)間: 2025-3-24 17:00
Der Kampf um die rechte Ordnungnected subgraph induced by a subset . of . such that each red vertex of . is adjacent to some vertex in .. The problem can be solved in . time by reduction to the . problem. Combining exhaustive enumeration when |.| is small with the . approach when |.| is large, solves the problem in .. In this pap作者: Ostrich 時(shí)間: 2025-3-24 19:51
Die Krisis der s?kularen Religionenled backlinks to . – producing the maximum increase in the PageRank value of .. This problem is known as . in the www context. We present a theorem describing how the topology of the graph comes in to play when evaluating potential new backlinks. Based on the theorem we show that no FPTAS exists for作者: pulmonary 時(shí)間: 2025-3-24 23:48 作者: 無(wú)能性 時(shí)間: 2025-3-25 03:48 作者: 努力趕上 時(shí)間: 2025-3-25 09:44
https://doi.org/10.1007/978-3-662-26431-7lgorithms that combine both techniques have been found very recently, but thus far always use exponential space..In this paper, we try to obtain fast exponential time algorithms for graph domination problems using only polynomial space. Using a novel treewidth based annotation procedure to deal with作者: 做方舟 時(shí)間: 2025-3-25 15:42 作者: 暫時(shí)過(guò)來(lái) 時(shí)間: 2025-3-25 17:04 作者: mastopexy 時(shí)間: 2025-3-25 22:51 作者: CYN 時(shí)間: 2025-3-26 01:48 作者: Arroyo 時(shí)間: 2025-3-26 08:09
https://doi.org/10.1007/978-3-663-13589-0ance measure) from every object with that property. In this work we design and analyze an algorithm for testing functions for the property of being computable by a read-once width-2 . (OBDD), also known as a ., where the order of the variables is . known to us. That is, we must accept a function . i作者: Malfunction 時(shí)間: 2025-3-26 10:51 作者: fallible 時(shí)間: 2025-3-26 13:05 作者: inhibit 時(shí)間: 2025-3-26 20:03
Rechnungswesen und Unternehmensüberwachung parameters have been identified which lead to fixed-parameter tractability (FPT). Recently, Gottlob and Lee have proposed the treewidth of the structure representing the graph and the set of pairs of terminal vertices as one such parameter. In this work, we show how this theoretical FPT result can 作者: Annotate 時(shí)間: 2025-3-27 00:30
Rechnungswesen und Unternehmensüberwachungization algorithm exploits the knowledge of an optimal solution to a problem instance for finding good solutions for a locally modified instance. We show that, in graphs satisfying a sharpened triangle inequality (and even in graphs where edge-costs are restricted to the values 1 and 1?+?. for an ar作者: 清楚 時(shí)間: 2025-3-27 04:00
,Thesenf?rmige Zusammenfassung,raph .?=?(.,.), a rational number?.?≥?1 and a weight function . on the vertices, and are asked whether a spanning tree?. for?. exists such that the combined weight of the leaves of?. is at least?.. We show that it is possible to transform an instance 〈.,., . 〉 of . in linear time into an equivalent 作者: 易于交談 時(shí)間: 2025-3-27 07:31 作者: Hay-Fever 時(shí)間: 2025-3-27 11:33 作者: Bmd955 時(shí)間: 2025-3-27 15:24
Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number sparse instances, we give an algorithm that counts the number of dominating sets of each size?. in a graph in . time and polynomial space. We also give an algorithm for the domatic number problem running in . time and polynomial space.作者: antedate 時(shí)間: 2025-3-27 21:25
Popular Matchings in the Marriage and Roommates Problems .. We investigate the relationship between popularity and stability, and describe efficient algorithms to test a matching for popularity in these settings. We also show that, when ties are permitted in the preferences, it is NP-hard to determine whether a popular matching exists in both the Roommates and Marriage cases.作者: collateral 時(shí)間: 2025-3-28 01:31 作者: 有權(quán) 時(shí)間: 2025-3-28 04:35 作者: indignant 時(shí)間: 2025-3-28 09:42
Die Krisis der s?kularen Religionenscribing how the topology of the graph comes in to play when evaluating potential new backlinks. Based on the theorem we show that no FPTAS exists for Link Building under the assumption NP≠P and we also show that Link Building is W[1]-hard.作者: 獸群 時(shí)間: 2025-3-28 11:00
https://doi.org/10.1007/978-3-662-26431-7hs. We also study the parameterized complexity of their parametric dual problems. Among these sixteen problems, we show that eight of them are fixed parameter tractable and four are W[1]-hard. Our main techniques are the color-coding method of Alon, Yuster and Zwick, and the random separation method of Cai, Chan and Chan.作者: 不給啤 時(shí)間: 2025-3-28 17:08
,Thesenf?rmige Zusammenfassung,of the graph there is a color that appears only once. We also study computational complexity aspects of conflict-free colorings and prove a completeness result. Finally, we improve lower bounds for those chromatic numbers of the grid graph.作者: upstart 時(shí)間: 2025-3-28 19:02
Rechnungswesen und Unternehmensüberwachungure representing the graph and the set of pairs of terminal vertices as one such parameter. In this work, we show how this theoretical FPT result can be turned into efficient algorithms for optimization, counting, and enumeration problems in this area.作者: 使熄滅 時(shí)間: 2025-3-28 23:15
Resilient Algorithms and Data Structuresce of memory faults have been introduced in the literature: in particular, an algorithm or a data structure is called resilient if it is able to work correctly on the set of uncorrupted values. In this invited talk I will survey recent work on resilient algorithms and data structures.作者: lipids 時(shí)間: 2025-3-29 06:28 作者: 護(hù)航艦 時(shí)間: 2025-3-29 09:05 作者: Prostaglandins 時(shí)間: 2025-3-29 12:17
Graph Unique-Maximum and Conflict-Free Coloringsof the graph there is a color that appears only once. We also study computational complexity aspects of conflict-free colorings and prove a completeness result. Finally, we improve lower bounds for those chromatic numbers of the grid graph.作者: laxative 時(shí)間: 2025-3-29 16:54
Multicut Algorithms via Tree Decompositionsure representing the graph and the set of pairs of terminal vertices as one such parameter. In this work, we show how this theoretical FPT result can be turned into efficient algorithms for optimization, counting, and enumeration problems in this area.作者: 600 時(shí)間: 2025-3-29 22:33
https://doi.org/10.1007/978-3-322-98513-2 design an algorithm of enumerating rooted cycles so that delivers the difference between two consecutive cycles in constant time in a series of all outputs. Hence our framework implies that, for the class . of all rooted cacti, there is an algorithm that enumerates each cactus in constant time.作者: Systemic 時(shí)間: 2025-3-30 03:43 作者: 小卷發(fā) 時(shí)間: 2025-3-30 04:48 作者: 噴油井 時(shí)間: 2025-3-30 11:33 作者: GLADE 時(shí)間: 2025-3-30 14:41 作者: 發(fā)怨言 時(shí)間: 2025-3-30 19:17 作者: 小畫(huà)像 時(shí)間: 2025-3-30 22:17 作者: bacteria 時(shí)間: 2025-3-31 03:24 作者: acclimate 時(shí)間: 2025-3-31 06:51
A Parameterized Algorithm for , give an algorithm with running time . to solve this problem, where . is the size of a minimum vertex cover of the graph (., .). Hence we show that the problem is fixed parameter tractable when parameterized by .. Note that the parameter does not assume any restriction on the input graph, and it concerns only the additional edge set ..作者: DOTE 時(shí)間: 2025-3-31 09:26
Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown.) we designed an algorithm for testing computability by an OBDD with a . order, which is known to the algorithm. Thus, we extend our knowledge concerning testing of functions that are characterized by their computability using simple computation devices and in the process gain some insight concerning these devices.作者: Lime石灰 時(shí)間: 2025-3-31 16:13
Strategic Coloring of a Graph the coloring game, we give worst case bounds on the social cost of stable states. Our main contribution is an improved (tight) bound for the worst case social cost of a Nash equilibrium, and the study of strong equilibria, their existence and how far they are from social optima.作者: EXALT 時(shí)間: 2025-3-31 17:34
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weightsices. The analysis of the kernel size is based on a new extremal result which shows that every graph . that excludes some simple substructures always contains a spanning tree with at least |.|/5.5 leaves.作者: optic-nerve 時(shí)間: 2025-3-31 23:30
Der Kampf um die rechte Ordnunger we present a first non-trivial exact algorithm whose running time is in .. We use our algorithm to solve the . problem in .. This improves the current best known algorithm, which used sophisticated run-time analysis via the measure and conquer technique to solve the problem in ..作者: conflate 時(shí)間: 2025-4-1 02:56
https://doi.org/10.1007/978-3-662-26431-7 sparse instances, we give an algorithm that counts the number of dominating sets of each size?. in a graph in . time and polynomial space. We also give an algorithm for the domatic number problem running in . time and polynomial space.作者: Blasphemy 時(shí)間: 2025-4-1 08:53
https://doi.org/10.1007/978-3-663-02158-2 .. We investigate the relationship between popularity and stability, and describe efficient algorithms to test a matching for popularity in these settings. We also show that, when ties are permitted in the preferences, it is NP-hard to determine whether a popular matching exists in both the Roommates and Marriage cases.作者: assail 時(shí)間: 2025-4-1 13:11
https://doi.org/10.1007/978-3-8350-9563-2phs this equality is true also for any even Δ?≥?6. In this paper we show that it is true for any Δ?≥?10, leaving open only the cases Δ=?6, 8..We present also an .(.log.) algorithm for partitioning a planar graph into max {la(.), 5} linear forests, which is optimal when Δ?≥?9.作者: Colonnade 時(shí)間: 2025-4-1 15:11 作者: Biofeedback 時(shí)間: 2025-4-1 18:59
Mechanisms for the Marriage and the Assignment Game in many areas. Most notably, it has lead to a number of truthful mechanisms that have seen a recent rejuvenation in the context of sponsored search. In this paper we survey the history of these problems and provide several links to ongoing research in the field.作者: 中國(guó)紀(jì)念碑 時(shí)間: 2025-4-2 02:03 作者: 手工藝品 時(shí)間: 2025-4-2 04:35 作者: Hamper 時(shí)間: 2025-4-2 07:43
