000 | 05188nam a22005655i 4500 | ||
---|---|---|---|
001 | 978-3-540-74450-4 | ||
003 | DE-He213 | ||
005 | 20160624102110.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2007 gw | s |||| 0|eng d | ||
020 |
_a9783540744504 _9978-3-540-74450-4 |
||
024 | 7 |
_a10.1007/978-3-540-74450-4 _2doi |
|
050 | 4 | _aQA76.9.A43 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aCOM051300 _2bisacsh |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aCombinatorics, Algorithms, Probabilistic and Experimental Methodologies _h[electronic resource] : _bFirst International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers / _cedited by Bo Chen, Mike Paterson, Guochuan Zhang. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2007. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2007. |
|
300 |
_aXII, 530 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v4614 |
|
505 | 0 | _aThe 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 -- 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 Parallel Corpus -- 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 -- 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. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer software. | |
650 | 0 | _aData mining. | |
650 | 0 | _aComputer simulation. | |
650 | 0 | _aOptical pattern recognition. | |
650 | 0 | _aBioinformatics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aPattern Recognition. |
650 | 2 | 4 | _aSimulation and Modeling. |
650 | 2 | 4 | _aData Mining and Knowledge Discovery. |
650 | 2 | 4 | _aComputational Biology/Bioinformatics. |
700 | 1 |
_aChen, Bo. _eeditor. |
|
700 | 1 |
_aPaterson, Mike. _eeditor. |
|
700 | 1 |
_aZhang, Guochuan. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540744498 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v4614 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-540-74450-4 |
942 |
_2EBK7755 _cEBK |
||
999 |
_c37049 _d37049 |