標(biāo)題: Titlebook: Automata, Languages, and Programming; 40th International C Fedor V. Fomin,Rūsi?? Freivalds,David Peleg Conference proceedings 2013 Springer [打印本頁(yè)] 作者: Malinger 時(shí)間: 2025-3-21 18:48
書(shū)目名稱Automata, Languages, and Programming影響因子(影響力)
書(shū)目名稱Automata, Languages, and Programming影響因子(影響力)學(xué)科排名
書(shū)目名稱Automata, Languages, and Programming網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Automata, Languages, and Programming網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Automata, Languages, and Programming被引頻次
書(shū)目名稱Automata, Languages, and Programming被引頻次學(xué)科排名
書(shū)目名稱Automata, Languages, and Programming年度引用
書(shū)目名稱Automata, Languages, and Programming年度引用學(xué)科排名
書(shū)目名稱Automata, Languages, and Programming讀者反饋
書(shū)目名稱Automata, Languages, and Programming讀者反饋學(xué)科排名
作者: 障礙物 時(shí)間: 2025-3-21 21:51
0302-9743 refereed proceedings of the 40th International Colloquium on Automata, Languages and Programming, ICALP 2013, held in Riga, Latvia, in July 2013. The total of 124 revised full papers presented were carefully reviewed and selected from 422 submissions. They are organized in three tracks focussing on 作者: 留戀 時(shí)間: 2025-3-22 02:44 作者: xanthelasma 時(shí)間: 2025-3-22 06:09 作者: Neonatal 時(shí)間: 2025-3-22 11:03
On the Extension Complexity of Combinatorial Polytopeshen obtain a relationship between the extension complexity of the cut polytope of a graph and that of its graph minors. Using this we are able to show exponential extension complexity for the cut polytope of a large number of graphs, including those used in quantum information and suspensions of cubic planar graphs.作者: TOM 時(shí)間: 2025-3-22 16:39
Tree Compression with Top Treesgational queries directly on the compressed representation. We show that the new compression scheme achieves close to optimal worst-case compression, can compress exponentially better than DAG compression, is never much worse than DAG compression, and supports navigational queries in logarithmic time.作者: 古老 時(shí)間: 2025-3-22 19:17 作者: 真實(shí)的人 時(shí)間: 2025-3-22 21:11 作者: 異端 時(shí)間: 2025-3-23 03:37 作者: 門(mén)窗的側(cè)柱 時(shí)間: 2025-3-23 05:54 作者: 潰爛 時(shí)間: 2025-3-23 12:03 作者: MAIM 時(shí)間: 2025-3-23 17:02
Exact Weight Subgraphs and the ,-Sum Conjecturest to the minimum-weight and (unweighted) detection versions, which can be solved easily in time .(..). We also show that a faster algorithm for any of the following three problems would yield faster algorithms for the others: 3-., ., and ..作者: Panther 時(shí)間: 2025-3-23 18:51 作者: Paleontology 時(shí)間: 2025-3-24 00:35
Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithman be almost fully parallelized. Our strategy for dealing with arbitrary instances is to instead inject the randomness into the dissection process itself by working over a carefully selected but random composite modulus, and to introduce explicit space–time controls into the algorithm by means of a “bailout mechanism”.作者: Anemia 時(shí)間: 2025-3-24 05:06
Approximation Algorithms for the Joint Replenishment Problem with Deadlineselaxation, giving a lower bound of 1.207, and an upper bound and approximation ratio of 1.574. The best previous upper bound and approximation ratio was 1.667; no lower bound was previously published. For the special case when all demand periods are of equal length we give an upper bound of 1.5, a lower bound of 1.2, and show APX-hardness.作者: 發(fā)現(xiàn) 時(shí)間: 2025-3-24 09:13
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Rae with a few random nodes |..|?=?.(1), a saddle point in pure stationary strategies can be found in time polynomial in |..|?+?|..|, the maximum absolute local reward ., and the common denominator of the transition probabilities.作者: 天空 時(shí)間: 2025-3-24 11:56
https://doi.org/10.1007/978-3-322-94717-8ounting the number of solutions of the CSP is in . (resp., ..-complete)..Also, we conjecture that a CSP instance is testable in sublinear time if its Gaifman graph has bounded treewidth. We confirm the conjecture when a near-unanimity operation is a polymorphism of the CSP.作者: needle 時(shí)間: 2025-3-24 17:25
Elementare Integrationsmethoden,ted graphs, respectively, where ..(.) denotes the time to compute a minimum-cost flow in a planar network with multiple sources and sinks. Our result is the first polynomial-time bend-optimization algorithm for general 4-planar graphs optimizing over all embeddings. Previous work considers restricted graph classes and unit costs.作者: Gudgeon 時(shí)間: 2025-3-24 19:07 作者: superfluous 時(shí)間: 2025-3-25 00:20
Optimal Orthogonal Graph Drawing with Convex Bend Coststed graphs, respectively, where ..(.) denotes the time to compute a minimum-cost flow in a planar network with multiple sources and sinks. Our result is the first polynomial-time bend-optimization algorithm for general 4-planar graphs optimizing over all embeddings. Previous work considers restricted graph classes and unit costs.作者: 漂亮 時(shí)間: 2025-3-25 07:17 作者: Freeze 時(shí)間: 2025-3-25 09:39
Tight Lower Bound for Linear Sketches of Momentstight lower bound of Ω(..log.) words for the class of algorithms based on linear sketches, which store only a sketch . of input vector . and some (possibly randomized) matrix .. We note that all known algorithms for this problem are linear sketches.作者: Atheroma 時(shí)間: 2025-3-25 15:32 作者: 沒(méi)血色 時(shí)間: 2025-3-25 16:20 作者: laparoscopy 時(shí)間: 2025-3-25 23:12
Search-Space Size in Contraction Hierarchiesnder a worst-case assumption on the edge lengths, our bounds are comparable to the recent results of Abraham et al. [1], whose analysis depends also on the edge lengths. As a side result, we link their notion of highway dimension (a parameter that is conjectured to be small, but is unknown for all p作者: Affection 時(shí)間: 2025-3-26 02:28 作者: 彎曲的人 時(shí)間: 2025-3-26 05:35 作者: 構(gòu)想 時(shí)間: 2025-3-26 11:44 作者: Femish 時(shí)間: 2025-3-26 16:41
On the Complexity of Higher Order Abstract Voronoi Diagramslidean and .. plane [18,19], and, very recently, for line segments [23]. These proofs made extensive use of the geometry of the sites..Our result on AVDs implies a 2. (.???.) upper bound for a wide range of cases for which only trivial upper complexity bounds were previously known, and a slightly sh作者: Tonometry 時(shí)間: 2025-3-26 18:09
Gew?hnliche Differentialgleichungen forest (PCSF), where we have . demands each requesting the connectivity of a pair of vertices. Our algorithm can be seen as a greedy algorithm which reduces the number of demands by choosing a structure with minimum cost-to-reduction ratio. This natural style of argument (also used by Klein and Rav作者: 織布機(jī) 時(shí)間: 2025-3-27 00:38
https://doi.org/10.1007/978-3-322-93992-0nder a worst-case assumption on the edge lengths, our bounds are comparable to the recent results of Abraham et al. [1], whose analysis depends also on the edge lengths. As a side result, we link their notion of highway dimension (a parameter that is conjectured to be small, but is unknown for all p作者: Bravado 時(shí)間: 2025-3-27 02:30
,Einführung und elementare L?sungsmethoden,the correct tree with high probability. We then give a Las-Vegas algorithm which also uses .(.) space and runs in the same time bounds with high probability when .. Furthermore, additional tradeoffs between the space usage and the construction time for the Monte-Carlo algorithm are given.作者: chronology 時(shí)間: 2025-3-27 08:26 作者: 老人病學(xué) 時(shí)間: 2025-3-27 12:16 作者: COKE 時(shí)間: 2025-3-27 15:22 作者: 輕浮女 時(shí)間: 2025-3-27 17:51
https://doi.org/10.1007/978-3-322-97816-5omplexity of this problem is strongly related to that of the infamous .-. problem. In particular, we show that under the .-. Conjecture, we can achieve tight upper and lower bounds for the .-. problem for various subgraphs . such as matching, star, path, and cycle..One interesting consequence is tha作者: Limousine 時(shí)間: 2025-3-27 22:58 作者: GRAZE 時(shí)間: 2025-3-28 03:04
https://doi.org/10.1007/978-3-642-97218-8he space complexity for approximately computing the .. moment, for .?∈?(0,2] has been settled [KNW10], for .?>?2 the exact complexity remains open. For .?>?2 the current best algorithm uses .(..log.) words of space [AKO11,BO10], whereas the lower bound is of Ω(..) [BJKS04]..In this paper, we show a 作者: ensemble 時(shí)間: 2025-3-28 06:53 作者: 結(jié)果 時(shí)間: 2025-3-28 14:06 作者: 不發(fā)音 時(shí)間: 2025-3-28 15:44
Lineare GDGn 1. Ordnung im $mathbb{R}^n$,fting argument to show exponential extension complexity for a number of NP-complete problems including subset-sum and three dimensional matching. We then obtain a relationship between the extension complexity of the cut polytope of a graph and that of its graph minors. Using this we are able to show作者: ORBIT 時(shí)間: 2025-3-28 19:27 作者: 協(xié)議 時(shí)間: 2025-3-29 02:22 作者: Nebulizer 時(shí)間: 2025-3-29 05:02
https://doi.org/10.1007/978-3-322-93992-0convincing practical results, there is still a lack of theoretical explanation for this behavior..In this paper, we develop a theoretical framework for studying search space sizes in contraction hierarchies. We prove the first bounds on the size of search spaces that depend solely on structural para作者: 憎惡 時(shí)間: 2025-3-29 10:09 作者: Frequency-Range 時(shí)間: 2025-3-29 12:21 作者: Criteria 時(shí)間: 2025-3-29 18:01 作者: prostate-gland 時(shí)間: 2025-3-29 22:16 作者: ethereal 時(shí)間: 2025-3-30 03:31
Gew?hnliche Differentialgleichungenf internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast navigational queries directly on the compressed representation. We show that the new compression scheme achieves close to optimal worst-case compression, 作者: 背心 時(shí)間: 2025-3-30 04:20 作者: 完整 時(shí)間: 2025-3-30 10:24
Elementare Integrationsmethoden, this neglects that in typical applications, edges have varying importance. We consider the problem . that is defined as follows. Given a planar graph . on . vertices with maximum degree?4 (.) and for each edge?. a cost function . defining costs depending on the number of bends . has, compute an ort作者: Digitalis 時(shí)間: 2025-3-30 13:23 作者: Talkative 時(shí)間: 2025-3-30 20:36
,Beweise der grundlegenden S?tze,s and circles. They serve as a unifying concept. Once the bisector system of any concrete type of Voronoi diagram is shown to fulfill the AVD properties, structural results and efficient algorithms become available without further effort. For example, the first optimal algorithms for constructing ne作者: 廢墟 時(shí)間: 2025-3-31 00:46
,Beweise der grundlegenden S?tze, .: .?→??, and three types of vertices: black .., white .., and random .. forming a partition of .. It is a long-standing open question whether a polynomial time algorithm for BWR-games exists, or not. In fact, a pseudo-polynomial algorithm for these games would already imply their polynomial solvab作者: BROW 時(shí)間: 2025-3-31 01:20 作者: Ornithologist 時(shí)間: 2025-3-31 05:52
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166240.jpg作者: 小隔間 時(shí)間: 2025-3-31 13:02
Automata, Languages, and Programming978-3-642-39206-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: staging 時(shí)間: 2025-3-31 17:00 作者: Corroborate 時(shí)間: 2025-3-31 19:29
Gew?hnliche Differentialgleichungenwas a .(log.) approximating for minimizing the total label size. We give an .(log.)-approximation algorithm for the maximum label size. We also give .(log.)-approximation algorithms for natural generalizations of the problem: Minimizing an ?. norm of the labeling and simultaneously minimizing ?. and ?. norms.作者: 柱廊 時(shí)間: 2025-4-1 00:24 作者: dominant 時(shí)間: 2025-4-1 03:06
https://doi.org/10.1007/978-3-642-39206-1approximation algorithms; computational complexity; dynamic programming; proof systems; randomized compu
