Charikar, M. et al. ed.
Approximation, Randomization, and Combinatorial Optimization
Springer-Verlag 2007.9
626 pp.(Softcover)
ISBN 3-540-74207-7
13,800円
Algorithms and Techniques 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings
Contents
*This volume presents the refereed proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and the 11th International Workshop on Randomization and Computation, both held in Princeton, New Jersey, in August 2007. Inside you’ll find 44 full papers presenting some of the latest findings and applications in the field. All of these papers were carefully reviewed by the volume’s editors.
* The papers cover design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, mathematical programming, coloring and partitioning, cuts and connectivity, geometric problems, game theory, network design and routing, packing and covering, scheduling, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness and derandomization, random combinatorial structures, random walks/Markov chains, expander graphs and randomness extractors, probabilistic proof systems, random projections and embeddings, error-correcting codes, average-case analysis, property testing, and computational learning theory. *
Ma, Bin; Zhang, K. ed.
Combinatorial Pattern Matching
Lecture Notes in Computer Science, Vol.4580
Springer-Verlag 2007.
366 pp. (P)
ISBN 3-540-73436-8
9,900円
18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings
Contents
* The 18th Annual Symposium on Combinatorial Pattern Matching was held in London, Canada in July 2007. Leading researchers and practitioners came to this meeting to present and discuss the latest findings and applications in the field. This volume features select refereed proceedings from the meeting.
* Thirty-two full papers are presented, together with three invited talks. Each one was carefully reviewed by the editors to ensure accuracy, thoroughness, and readability. Collectively, the papers provide great insight into the most recent advances in combinatorial pattern matching. Papers are organized into topical sections covering algorithmic techniques, approximate pattern matching, data compression, computational biology, pattern analysis, suffix arrays and trees, and algorithmic techniques. *
Dress, A. et al.
Combinatorial Optimization and Applications
Lecture Notes in Computer Science, Vol.4616
Springer-Verlag 2007.
390 pp. (P)
ISBN 3-540-73555-0
10,600円
1st International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings
Contents
* Running to almost 400 pages, and featuring more than 40 papers, this work on combinatorial optimization and applications will be seen as an important addition to the literature.
* It constitutes the refereed proceedings of the first International Conference on Combinatorial Optimization and Applications, COCOA 2007, held in Xi'an, China in August of that year.
* The 29 revised full papers presented together with 8 invited papers and 2 invited presentations were carefully reviewed and selected from 114 submissions. What readers get is an up-to-date reference of original research in the areas of combinatorial optimization. *
Gonzalez, T.F. ed.
Handbook of Approximation Algorithms and Metaheuristics
CRC Press 2007.5
1416 pp. (H)
ISBN 1-58488-550-5
22,500円
Contents
PREFACE Part 1.BASIC METHODOLOGIES: 1.Introduction, Overview, and Notation/ 2.Basic Methodologies and Applications/ 3.Restriction Methods/ 4.Greedy Methods/ 5.Recursive Greedy Methods/ 6.Linear Programming/ 7.LP Rounding and Extensions/ 8.On Analyzing Semidefinite Programming Relaxations of Complex/ 9.Quadratic Optimization Problems/ 10.Polynomial-Time Approximation Schemes/ 11.Rounding, Interval Partitioning, and Separation/ 12.Asymptotic Polynomial-Time Approximation Schemes/ 13.Randomized Approximation Techniques/ 14.Distributed Approximation Algorithms via LP-Duality and Randomization/ 15.Empirical Analysis of Randomized Algorithms/ 16.Reductions that Preserve Approximability/ 17.Differential Ratio Approximation/ 18.Hardness of Approximation/ Part 2.LOCAL SEARCH, NEURAL NETWORKS, AND METAHEURISTICS: 19.Local Search/ 20.Stochastic Local Search/ 21.Very Large-Scale Neighborhood Search: Theory, Algorithms, and Applications/ 22.Reactive Search: Machine Learning for Memory-Based Heuristics/ 23.Neural Networks/ 24.Principles of Tabu Search/ 25.Evolutionary Computation/ 26.Simulated Annealing/ 27.Ant Colony Optimization/ 28.Memetic Algorithms/ Part 3.MULTIOBJECTIVE OPTIMIZATION, SENSITIVITY ANALYSIS, AND STABILITY: 29.Approximation in Multiobjective Problems/ 30.Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization: A Review/ 31.Sensitivity Analysis in Combinatorial Optimization/ 32.Stability of Approximation/ Part 4.TRADITIONAL APPLICATIONS: 33.Performance Guarantees for One-Dimensional Bin Packing/ 34.Variants of Classical One-Dimensional Bin Packing/ 35.Variable, Sized Bin Packing and Bin Covering/ 36.Multidimensional Packing Problems/ 37.Practical Algorithms for Two-Dimensional Packing 38.A Generic Primal-Dual Approximation Algorithm for an Interval Packing and Stabbing Problem/ 39.Approximation Algorithms for Facility Dispersion/ 40.Greedy Algorithms for Metric Facility Location Problems/ 41.Prize-Collecting Traveling Salesman and Related Problems/ 42.A Development and Deployment Framework for Distributed Branch and Bound/ 43.Approximations for Steiner Minimum Trees/ 44.Practical Approximations of Steiner Trees in Uniform Orientation Metrics/ 45.Approximation Algorithms for Imprecise Computation Tasks with 0/1 Constraint Scheduling Malleable Tasks/ 46.Vehicle Scheduling Problems in Graphs/ 47.Approximation Algorithms and Heuristics for Classical Planning/ 48.Generalized Assignment Problem/ 49.Probabilistic Greedy Heuristics for Satisfiability Problems/ Part 5.COMPUTATIONAL GEOMETRY AND GRAPH APPLICATIONS: 50.Approximation Algorithms for Some Optimal 2D and 3D Triangulations/ 51.Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs Dilation and Detours in Geometric Networks/ 52.The Well-Separated Pair Decomposition and its Applications/ 53.Minimum-Edge Length Rectangular Partitions/ 54.Partitioning Finite d-Dimensional Integer Grids with Applications/ 55.Maximum Planar Subgraph/ 56.Edge-Disjoint Paths and Unsplittable Flow/ 57.Approximating Minimum-Cost Connectivity Problems/ 58.Optimum Communication Spanning Trees/ 59.Approximation Algorithms for Multilevel Graph Partitioning/ 60.Hypergraph Partitioning and Clustering/ 61.Finding Most Vital Edges in a Graph/ 62.Stochastic Local Search Algorithms for the Graph Coloring Problem/ 63.On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization/ Part 6.LARGE-SCALE AND EMERGING APPLICATIONS: 64.Cost-Efficient Multicast Routing in Ad Hoc and Sensor Networks/ 65.Approximation Algorithm for Clustering in Ad Hoc Networks/ 66.Topology Control Problems for Wireless Ad Hoc Networks/ 67.Geometrical Spanner for Wireless Ad Hoc Networks/ 68.Multicast Topology Inference and its Applications/ 69.Multicast Congestion in Ring Networks/ 70.QoS Multimedia Multicast Routing/ 71.Overlay Networks for Peer-to-Peer Networks/ 72.Scheduling Data Broadcasts on Wireless Channels: Exact Solutions and Heuristics/ 73.,Combinatorial and Algorithmic Issues for Microarray Analysis/ 74.Approximation Algorithms for the Primer Selection, Planted Motif Search, and Related Problems/ 75.Dynamic and Fractional Programming-Based Approximation Algorithms for Sequence Alignment with Constraints/ 76.Approximation Algorithms for the Selection of Robust Tag SNPs/ 77.Sphere Packing and Medical Applications/ 78.Large-Scale Global Placement / 79.Multicommodity Flow Algorithms for Buffered Global Routing/ 80.Algorithmic Game Theory and Scheduling/ 81.Approximate Economic Equilibrium Algorithms/ 82.Approximation Algorithms and Algorithm Mechanism Design/ 83.Histograms, Wavelets, Streams, and Approximation/ 84.Digital Reputation for Virtual Communities/ 85.Color Quantization/ INDEX/ *
Artemov, S. & Nerode, A. ed.
Logical Foundations of Computer Science
Springer-Verlag 2007.7
513 pp. (P)
ISBN 3-540-72732-9
12,800円
International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings
Contents
* This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2007, held in New York, NY, USA in June 2007.
* The volume presents 36 revised refereed papers carefully selected by the program committee. It addresses all current aspects of logic in computer science, including constructive mathematics and type theory, logical foundations of programming, logical aspects of computational complexity, logic programming and constraints, automated deduction and interactive theorem proving, logical methods in protocol and program verification and in program specification and extraction, domain theory logics, logical foundations of database theory, equational logic and term rewriting, lambda and combinatory calculi, categorical logic and topological semantics, linear logic, epistemic and temporal logics, intelligent and multiple agent system logics, logics of proof and justification, nonmonotonic reasoning, logic in game theory and social software, logic of hybrid systems, distributed system logics, system design logics, as well as other logics in computer science. *
928-10 登録日 08.01.06
