Combinatorics, Algorithms, Probabilistic and Experimental Methodologies First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers

Bibliographic Details
Other Authors: Chen, Bo (Editor), Paterson, Mike (Editor), Zhang, Guochuan (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2007, 2007
Edition:1st ed. 2007
Series:Theoretical Computer Science and General Issues
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 04560nmm a2200409 u 4500
001 EB000379339
003 EBX01000000000000000232391
005 00000000000000.0
007 cr|||||||||||||||||||||
008 130626 ||| eng
020 |a 9783540744504 
100 1 |a Chen, Bo  |e [editor] 
245 0 0 |a Combinatorics, Algorithms, Probabilistic and Experimental Methodologies  |h Elektronische Ressource  |b First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers  |c edited by Bo Chen, Mike Paterson, Guochuan Zhang 
250 |a 1st ed. 2007 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2007, 2007 
300 |a XII, 530 p  |b online resource 
505 0 |a Optimal Commodity Distribution for a Vehicle with Fixed Capacity Under Vendor Managed Inventory -- On-Line Bin Packing with Arbitrary Release Times -- On the Complexity of the Max-Edge-Coloring Problem with Its Variants -- Quantitative Analysis of Multi-hop Wireless Networks Using a Novel Paradigm -- Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance -- Robust Optimization Model for a Class of Uncertain Linear Programs -- An Efficient Algorithm for Solving the Container Loading Problem -- A Bijective Code for k-Trees with Linear Time Encoding and Decoding -- Market-Based Service Selection Framework in Grid Computing -- Informative Gene Selection and Tumor Classification by Null Space LDA for Microarray Data -- Heuristic Search for 2D NMR Alignment to Support Metabolite Identification -- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array --  
505 0 |a The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I)???11/9OPT(I)?+?6/9 -- Sequential Vector Packing -- A Tighter Analysis of Set Cover Greedy Algorithm for Test Set -- A More Effective Linear Kernelization for Cluster Editing -- CR-precis: A Deterministic Summary Structure for Update Data Streams -- An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning -- On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems -- A Digital Watermarking Scheme Based on Singular Value Decomposition -- A New (t,n)??Threshold Scheme Based on Difference Equations -- Clique-Transversal Sets in Cubic Graphs -- On the L(h,k)-Labeling of Co-comparability Graphs -- An Approximation Algorithm for the General Mixed Packing and Covering Problem -- Extending the Hardness of RNA Secondary Structure Comparison -- On the On-Line Weighted k-Taxi Problem --  
505 0 |a Model Futility and Dynamic Boundaries with Application in Banking Default Risk Modeling -- On the Minimum Risk-Sum Path Problem -- Constrained Cycle Covers in Halin Graphs -- Optimal Semi-online Algorithms for Scheduling with Machine Activation Cost -- A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection -- Online Coupon Consumption Problem -- Application of Copula and Copula-CVaR in the Multivariate Portfolio Optimization -- Online Capacitated Interval Coloring -- Energy Efficient Heuristic Scheduling Algorithms for Multimedia Service -- Call Control and Routing in SONET Rings -- Fast Matching Method for DNA Sequences -- All-Pairs Ancestor Problems in Weighted Dags -- Streaming Algorithms for Data in Motion -- A Scheduling Problem with One Producer and the Bargaining Counterpart with Two Producers -- Phrase-Based Statistical Language Modeling from Bilingual ParallelCorpus --  
505 0 |a Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem -- Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach -- A New Load Balanced Routing Algorithm for Torus Networks -- Optimal Semi-online Scheduling Algorithms on a Small Number of Machines -- Lower Bounds on Edge Searching 
653 |a Bioinformatics 
653 |a Computational and Systems Biology 
653 |a Computer simulation 
653 |a Algorithms 
653 |a Computer Modelling 
653 |a Data mining 
653 |a Data Mining and Knowledge Discovery 
653 |a Automated Pattern Recognition 
653 |a Pattern recognition systems 
700 1 |a Paterson, Mike  |e [editor] 
700 1 |a Zhang, Guochuan  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Theoretical Computer Science and General Issues 
028 5 0 |a 10.1007/978-3-540-74450-4 
856 4 0 |u https://doi.org/10.1007/978-3-540-74450-4?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 518.1