標(biāo)題: Titlebook: Algorithms - ESA 2009; 17th Annual European Amos Fiat,Peter Sanders Conference proceedings 2009 Springer-Verlag Berlin Heidelberg 2009 Sche [打印本頁(yè)] 作者: 側(cè)面上下 時(shí)間: 2025-3-21 18:59
書目名稱Algorithms - ESA 2009影響因子(影響力)
書目名稱Algorithms - ESA 2009影響因子(影響力)學(xué)科排名
書目名稱Algorithms - ESA 2009網(wǎng)絡(luò)公開度
書目名稱Algorithms - ESA 2009網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms - ESA 2009被引頻次
書目名稱Algorithms - ESA 2009被引頻次學(xué)科排名
書目名稱Algorithms - ESA 2009年度引用
書目名稱Algorithms - ESA 2009年度引用學(xué)科排名
書目名稱Algorithms - ESA 2009讀者反饋
書目名稱Algorithms - ESA 2009讀者反饋學(xué)科排名
作者: Creditee 時(shí)間: 2025-3-21 21:11 作者: 強(qiáng)所 時(shí)間: 2025-3-22 03:37 作者: 的闡明 時(shí)間: 2025-3-22 04:34
A Linear Time Algorithm for ,(2,1)-Labeling of Trees algorithm for trees had been .(Δ..) for more than a decade, and an .( min {..,Δ..})-time algorithm has appeared recently, where Δ is the maximum degree of . and .?=?|.(.)|, however, it has been open if it is solvable in linear time. In this paper, we finally settle this problem for .(2,1)-labeling of trees by establishing a linear time algorithm.作者: Foment 時(shí)間: 2025-3-22 09:39 作者: gerrymander 時(shí)間: 2025-3-22 13:55
Iterative Rounding for Multi-Objective Optimization Problemsl-time approximation schemes that, for any constant .>?0 and .?≥?1, compute a solution violating each budget constraint at most by a factor (1?+?.). The weight of the solution is optimal for the first two problems, and (1???.)-approximate for the last one.作者: 不可比擬 時(shí)間: 2025-3-22 18:02 作者: 改良 時(shí)間: 2025-3-22 21:46
Betriebswirtschaftliche Beitr?geive a 2...-approximation algorithm. This is the first polynomial-time approximation algorithm for this problem with approximation ratio depending only on ., for any .?>?1. Our approach starts from iterated LP relaxation, and then uses probabilistic and greedy methods to recover a feasible solution.作者: 仔細(xì)閱讀 時(shí)間: 2025-3-23 04:34
https://doi.org/10.1007/978-3-7091-4804-4the boundary of a convex body in ?.. The number of edges in these spanners is .(.log.). This bound on the stretch factor is nearly optimal: in any finite metric space and for any .>?0, it is possible to assign weights to the elements such that any non-complete graph has stretch factor larger than 2???..作者: 劇本 時(shí)間: 2025-3-23 08:34 作者: 不可救藥 時(shí)間: 2025-3-23 11:52 作者: 內(nèi)疚 時(shí)間: 2025-3-23 14:05 作者: Glaci冰 時(shí)間: 2025-3-23 19:05
Constructing Delaunay Triangulations along Space-Filling Curves needs quadratic time, but that this can only happen in degenerate cases. We show that the algorithm runs in .(. log.) time under realistic assumptions. Furthermore, we show that it runs in expected linear time for many random point distributions.作者: 運(yùn)動(dòng)的我 時(shí)間: 2025-3-23 22:39
0302-9743 eld annually since 1993, and seeks to cover both theoretical and engineering aspects of algorithms. The authors were asked to classify their paper under one or more categories as described in Fig. 1. Since 2001, ESA has been the core of the larger ALGO conference, which typically includes several sa作者: Dri727 時(shí)間: 2025-3-24 06:04 作者: HILAR 時(shí)間: 2025-3-24 07:15 作者: 庇護(hù) 時(shí)間: 2025-3-24 11:10
https://doi.org/10.1007/978-3-642-91741-7ch that every two curves intersect at least once and finitely many times and no three curves intersect at a single point possesses the following Hamiltonian-type property: the union of the curves in . contains a simple cycle that visits every curve in . exactly once.作者: travail 時(shí)間: 2025-3-24 17:17
Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasksto count other objects. For example, one can count the number of independent sets of all possible sizes simultaneously with the same running time. These counting algorithms not only work for trees, but can be extended to arbitrary graphs of bounded tree-width.作者: 高原 時(shí)間: 2025-3-24 19:30 作者: 天文臺(tái) 時(shí)間: 2025-3-25 00:47
On Inducing Polygons and Related Problemsch that every two curves intersect at least once and finitely many times and no three curves intersect at a single point possesses the following Hamiltonian-type property: the union of the curves in . contains a simple cycle that visits every curve in . exactly once.作者: Ostrich 時(shí)間: 2025-3-25 05:02
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs following problems: (i) hitting hyper-rectangles by points in .; (ii) stabbing connected objects by axis-parallel hyperplanes in .; and (iii) hitting half-planes by points. For both the covering and hitting set versions, we obtain incremental polynomial-time algorithms, provided that the dimension . is fixed.作者: 確定無(wú)疑 時(shí)間: 2025-3-25 10:53 作者: conifer 時(shí)間: 2025-3-25 14:25
https://doi.org/10.1007/978-3-642-91741-7 With the same running time, the algorithm can be generalized in two directions. The algoritm is a counting algorithm, and the same ideas can be used to count other objects. For example, one can count the number of independent sets of all possible sizes simultaneously with the same running time. The作者: 反感 時(shí)間: 2025-3-25 17:09 作者: 愛花花兒憤怒 時(shí)間: 2025-3-25 22:01
https://doi.org/10.1007/978-3-642-91741-7are adjacent and |.(.)???.(.)|?≥?1 if . and . are at distance 2, for all . and . in .(.). A .-.(2,1)-labeling is an .(2,1)-labeling .:.(.)→{0,...,.}, and the .(2,1)-labeling problem asks the minimum ., which we denote by .(.), among all possible assignments. It is known that this problem is NP-hard 作者: 防御 時(shí)間: 2025-3-26 02:20 作者: Crepitus 時(shí)間: 2025-3-26 05:26 作者: 古老 時(shí)間: 2025-3-26 09:51
Betriebswirtschaftliche Beitr?ge., .?≤?.?≤?.} where . has at most . nonzeroes per row, we give a .-approximation algorithm. (We assume ., ., ., . are nonnegative.) For any .?≥?2 and .>?0, if .?≠?. this ratio cannot be improved to .???1???., and under the unique games conjecture this ratio cannot be improved to .???.. One key idea 作者: refine 時(shí)間: 2025-3-26 15:52 作者: 談判 時(shí)間: 2025-3-26 20:33 作者: 朦朧 時(shí)間: 2025-3-26 23:34
Der Entwicklungsstand der Herzchirurgie,y . in ?. is bounded by a function of .. Denote by .(.) (resp.?.(.)) the supremum of the ratio of the transversal number . to the packing number . over all families . of translates (resp.?homothets) of a convex body . in ?.. Kim et?al. recently showed that .(.) is bounded by a function of . for any 作者: 報(bào)復(fù) 時(shí)間: 2025-3-27 03:50
https://doi.org/10.1007/978-3-642-91539-0 following problems: (i) hitting hyper-rectangles by points in .; (ii) stabbing connected objects by axis-parallel hyperplanes in .; and (iii) hitting half-planes by points. For both the covering and hitting set versions, we obtain incremental polynomial-time algorithms, provided that the dimension 作者: Preserve 時(shí)間: 2025-3-27 06:10
https://doi.org/10.1007/978-3-476-04537-9is done via a first-price auction, which does not realistically model the Generalized Second Price (GSP) auction used in practice. Towards the goal of more realistically modeling these auctions, we introduce the . problem, in which bidders’ payments are determined by the GSP mechanism. We show that 作者: 符合你規(guī)定 時(shí)間: 2025-3-27 12:58 作者: 胡言亂語(yǔ) 時(shí)間: 2025-3-27 15:47 作者: 難理解 時(shí)間: 2025-3-27 21:14 作者: MENT 時(shí)間: 2025-3-28 01:13 作者: Cultivate 時(shí)間: 2025-3-28 03:50
Beschreibung einzelner Bergbaue, Moreover, for every point ., the distance between . and . in . is within a factor of (1?+?.) close to their Euclidean distance ||.,.||. We call these trees . (NSLLTs). We demonstrate that our construction achieves optimal (up to constant factors) tradeoffs between . parameters of NSLLTs. Our constr作者: OFF 時(shí)間: 2025-3-28 09:43 作者: Fulsome 時(shí)間: 2025-3-28 13:22
https://doi.org/10.1007/978-3-322-89258-4A famous theorem by Cauchy states that the dihedral angles of a convex polyhedron are determined by the incidence structure and face-polygons alone. In this paper, we prove the same for orthogonal polyhedra of genus 0 as long as no face has a hole. Our proof yields a linear-time algorithm to find the dihedral angles.作者: 梯田 時(shí)間: 2025-3-28 16:24 作者: 被詛咒的人 時(shí)間: 2025-3-28 20:10
Some Open Questions Related to Cuckoo HashingThe purpose of this brief note is to describe recent work in the area of cuckoo hashing, including a clear description of several open problems, with the hope of spurring further research.作者: FOLD 時(shí)間: 2025-3-29 01:47
Cauchy’s Theorem for Orthogonal Polyhedra of Genus 0A famous theorem by Cauchy states that the dihedral angles of a convex polyhedron are determined by the incidence structure and face-polygons alone. In this paper, we prove the same for orthogonal polyhedra of genus 0 as long as no face has a hole. Our proof yields a linear-time algorithm to find the dihedral angles.作者: compose 時(shí)間: 2025-3-29 06:48
A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexityWe present a global optimization algorithm for MINLPs (mixed-integer nonlinear programs) where any non-convexity is manifested as sums of non-convex univariate functions. The algorithm is implemented at the level of a modeling language, and we have had substantial success in our preliminary computational experiments.作者: 不舒服 時(shí)間: 2025-3-29 08:26 作者: Dissonance 時(shí)間: 2025-3-29 12:10 作者: 厭煩 時(shí)間: 2025-3-29 15:59 作者: 憤慨點(diǎn)吧 時(shí)間: 2025-3-29 23:14 作者: 褪色 時(shí)間: 2025-3-30 01:42 作者: 一大群 時(shí)間: 2025-3-30 04:48
Improved Approximation Algorithms for Label Cover Problemsimation ratios known were .. In fact, several recent papers reduced . to other problems, arguing that if better approximation algorithms for their problems existed, then a .-approximation algorithm for . would exist..We show, in fact, that there are a .(..)-approximation algorithm for . and a .(..lo作者: Osteoarthritis 時(shí)間: 2025-3-30 08:33 作者: 字謎游戲 時(shí)間: 2025-3-30 13:21 作者: 加花粗鄙人 時(shí)間: 2025-3-30 17:34
Computing 3D Periodic Triangulationsomedical computing, fluid dynamics etc. We design an algorithmic test to check whether a partition of the 3D flat torus into tetrahedra forms a triangulation (which subsumes that it is a simplicial complex). We propose an incremental algorithm that computes the Delaunay triangulation of a set of poi作者: 積云 時(shí)間: 2025-3-30 20:59 作者: LEVER 時(shí)間: 2025-3-31 04:28 作者: inchoate 時(shí)間: 2025-3-31 08:30 作者: Progesterone 時(shí)間: 2025-3-31 11:06 作者: STING 時(shí)間: 2025-3-31 16:41 作者: 使困惑 時(shí)間: 2025-3-31 17:42 作者: VOK 時(shí)間: 2025-4-1 01:28
Clustering-Based Bidding Languages for Sponsored Searchn difficulty facing the advertisers in this market is the complexity of picking and evaluating keywords and phrases to bid on. This is due to the sheer number of possible keywords that the advertisers can bid on, and leads to inefficiencies in the market such as lack of coverage for “rare” keywords.作者: 允許 時(shí)間: 2025-4-1 04:56
Altruism in Atomic Congestion Gameslfish and social objectives. In particular, we assume agents optimize a linear combination of personal delay of a strategy and the resulting social cost. Stable states are the Nash equilibria of these games, and we examine their existence and the convergence of sequential best-response dynamics. For作者: grounded 時(shí)間: 2025-4-1 09:51
Geometric Spanners for Weighted Point Setsdistance function .., where ..(.,.) is w(.)?+?.(.,.)?+?. if .?≠?. and 0 otherwise. We present a general method for turning spanners with respect to the .-metric into spanners with respect to the ..-metric. For any given .>?0, we can apply our method to obtain (5?+?.)-spanners with a linear number of作者: nutrition 時(shí)間: 2025-4-1 13:29
-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Treese approximating trees are required to be (subgraph) spanning trees of the given graph (or multigraph), in which case, the focus is usually on the equivalent problem of finding a (single) tree with low average stretch. Among the classes of graphs that received special attention in this context are .-作者: Dissonance 時(shí)間: 2025-4-1 17:22
Narrow-Shallow-Low-Light Trees with and without Steiner Points Moreover, for every point ., the distance between . and . in . is within a factor of (1?+?.) close to their Euclidean distance ||.,.||. We call these trees . (NSLLTs). We demonstrate that our construction achieves optimal (up to constant factors) tradeoffs between . parameters of NSLLTs. Our constr作者: alcohol-abuse 時(shí)間: 2025-4-1 19:25
Der Entwicklungsstand der Herzchirurgie,methods for obtaining upper bounds are constructive and lead to efficient constant-factor approximation algorithms for finding a minimum-cardinality point set that pierces a set of translates or homothets of a convex body.作者: entrance 時(shí)間: 2025-4-2 01:56
https://doi.org/10.1007/978-3-476-04537-9is APX-hard, and for online 2PM there is no deterministic algorithm achieving a non-trivial competitive ratio and no randomized algorithm achieving a competitive ratio better than 2. This stands in contrast to the results for the analogous special case in the first-price model, the standard bipartit作者: 補(bǔ)充 時(shí)間: 2025-4-2 05:33 作者: Aspiration 時(shí)間: 2025-4-2 08:09
,Die selektive Erdschlu?bek?mpfung,ilibrium and any better-response dynamics converges. In addition, we consider a scenario in which a central altruistic institution can motivate agents to act altruistically. We provide constructive and hardness results for finding the minimum number of altruists to stabilize an optimal congestion pr
