Algorithms - ESA 2004 : 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004. Proceedings (Lecture Notes in Computer Science Vol.3221) (2004. XVIII, 836 p. 23,5 cm)

3,850 TWD
KPC會員價
3,465
English

產品說明

Invited Lectures.- A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing.- Algorithmic Aspects of Web Search Engines.- Design and Analysis Track.- Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects.- Swap and Mismatch Edit Distance.- Path Decomposition Under a New Cost Measure with Applications to Optical Network Design.- Optimal External Memory Planar Point Enclosure.- Maximizing Throughput in Multi-queue Switches.- An Improved Algorithm for CIOQ Switches.- Labeling Smart Dust.- Graph Decomposition Lemmas and Their Role in Metric Embedding Methods.- Modeling Locality: A Probabilistic Analysis of LRU and FWF.- An Algorithm for Computing DNA Walks.- Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems.- Direct Routing: Algorithms and Complexity.- Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families.- A Parameterized Algorithm for Upward Planarity Testing.- Fisher Equilibrium Price with a Class of Concave Utility Functions.- Hardness and Approximation Results for Packing Steiner Trees.- Approximation Hardness of Dominating Set Problems.- Improved Online Algorithms for Buffer Management in QoS Switches.- Time Dependent Multi Scheduling of Multicast.- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems.- The Average Case Analysis of Partition Sorts.- A Fast Distributed Algorithm for Approximating the Maximum Matching.- Extreme Points Under Random Noise.- Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings.- On Variable-Sized Multidimensional Packing.- An Inductive Construction for Plane Laman Graphs via Vertex Splitting.- Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.- On the Evolution of Selfish Routing.- Competitive Online Approximation of the Optimal Search Ratio.- Incremental Algorithms for Facility L

XXXVI, 836 p.

開放訂購

預計出貨時間約 4-8 weeks

我們已盡力確保庫存狀態正確,但偶爾仍可能會出現顯示狀態不符的情況。實際庫存狀況仍需以現場及供應商是否可提供為主。

訂單金額滿 1,000TWD 即可享有國內免運費優惠

折扣將於結帳時套用。

最近瀏覽過的項目

相關產品