Combinatorics, Algorithms, Probabilistic and Experimental Methodologies: First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected PapersBo Chen, Mike Paterson, Guochuan Zhang Springer, 2007. gada 17. sept. - 530 lappuses The refereed post-proceedings of the First International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies are presented in this volume. The symposium provided an interdisciplinary forum for researchers to share their discoveries and approaches. The 46 full papers address large data processing problems using different methodologies from major disciplines such as computer science, combinatorics, and statistics. |
No grāmatas satura
1.–5. rezultāts no 91.
1. lappuse
... proof, and showed that the additive constant is not more than 3. Then, in 1991, Yue Minyi [4] proved that FFD(I) ≤ 11/9OPT(I) + 1, but his proof has some problems. It is not easy to understand, and leaves many gaps to be verified by ...
... proof, and showed that the additive constant is not more than 3. Then, in 1991, Yue Minyi [4] proved that FFD(I) ≤ 11/9OPT(I) + 1, but his proof has some problems. It is not easy to understand, and leaves many gaps to be verified by ...
2. lappuse
... proof of [4]. Since the tight upper bound was not known previously, even the next question, which seems to be quite trivial, could not be answered: Is there an instance I for the problem for which OPT(I)=5 and FFD(I) = 7 hold? In the ...
... proof of [4]. Since the tight upper bound was not known previously, even the next question, which seems to be quite trivial, could not be answered: Is there an instance I for the problem for which OPT(I)=5 and FFD(I) = 7 hold? In the ...
4. lappuse
... Proof. Swap one by one the items in B∗j that dominate them. Then omitting the elements of this bin we get a smaller counterexample, that is a contradiction. by items of Bi Lemma 3. Each optimal bin contains at least three items. Proof ...
... Proof. Swap one by one the items in B∗j that dominate them. Then omitting the elements of this bin we get a smaller counterexample, that is a contradiction. by items of Bi Lemma 3. Each optimal bin contains at least three items. Proof ...
5. lappuse
... Proof. If 2 ≤ OPT(I) ≤ 4, then from Corollary1we get that X > 1/4, which is contradiction. Reference [6] shows that in case OPT(I) = 5 follows that FFD(I) ≤ 6, which contradicts to (3). Thus follows that OPT(I) ≥ 6. Similarly we get ...
... Proof. If 2 ≤ OPT(I) ≤ 4, then from Corollary1we get that X > 1/4, which is contradiction. Reference [6] shows that in case OPT(I) = 5 follows that FFD(I) ≤ 6, which contradicts to (3). Thus follows that OPT(I) ≥ 6. Similarly we get ...
6. lappuse
... Proof. Suppose to the contrary that there is an item xk ≤ 1−L holds. Let xk be the last such item. This is packed ... Proof. The proof is similar to the previous one. 3. Case. 1/5. <. X. ≤. 1/4. We put the items into some classes according ...
... Proof. Suppose to the contrary that there is an item xk ≤ 1−L holds. Let xk be the last such item. This is packed ... Proof. The proof is similar to the previous one. 3. Case. 1/5. <. X. ≤. 1/4. We put the items into some classes according ...
Saturs
1 | |
12 | |
24 | |
36 | |
A Deterministic Summary Structure for Update Data Streams | 48 |
An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning | 60 |
On the Complexity and Approximation of the MinSum and MinMax Disjoint Paths Problems | 70 |
A Digital Watermarking Scheme Based on Singular Value Decomposition | 82 |
Fast Matching Method for DNA Sequences | 271 |
AllPairs Ancestor Problems in Weighted Dags | 282 |
Streaming Algorithms for Data in Motion | 294 |
A Scheduling Problem with One Producer and the Bargaining Counterpart with Two Producers | 305 |
PhraseBased Statistical Language Modeling from Bilingual Parallel Corpus | 317 |
Optimal Commodity Distribution for a Vehicle with Fixed Capacity Under Vendor Managed Inventory | 329 |
OnLine Bin Packing with Arbitrary Release Times | 340 |
On the Complexity of the MaxEdgeColoring Problem with Its Variants | 350 |
A New t nThreshold Scheme Based on Difference Equations | 94 |
CliqueTransversal Sets in Cubic Graphs | 107 |
On the Lh kLabeling of Cocomparability Graphs | 116 |
An Approximation Algorithm for the General Mixed Packing and Covering Problem | 128 |
Extending the Hardness of RNA Secondary Structure Comparison | 140 |
On the OnLine Weighted kTaxi Problem | 152 |
Model Futility and Dynamic Boundaries with Application in Banking Default Risk Modeling | 163 |
On the Minimum RiskSum Path Problem | 175 |
Constrained Cycle Covers in Halin Graphs | 186 |
Optimal Semionline Algorithms for Scheduling with Machine Activation Cost | 198 |
A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection | 209 |
Online Coupon Consumption Problem | 219 |
Application of Copula and CopulaCVaR in the Multivariate Portfolio Optimization | 231 |
Online Capacitated Interval Coloring | 243 |
Energy Efficient Heuristic Scheduling Algorithms for Multimedia Service | 255 |
Call Control and Routing in SONET Rings | 260 |
Quantitative Analysis of Multihop Wireless Networks Using a Novel Paradigm | 362 |
Inverse MinMax Spanning Tree Problem Under the Weighted SumType Hamming Distance | 375 |
Robust Optimization Model for a Class of Uncertain Linear Programs | 384 |
An Efficient Algorithm for Solving the Container Loading Problem | 396 |
A Bijective Code for kTrees with Linear Time Encoding and Decoding | 408 |
MarketBased Service Selection Framework in Grid Computing | 421 |
Informative Gene Selection and Tumor Classification by Null Space LDA for Microarray Data | 435 |
Heuristic Search for 2D NMR Alignment to Support Metabolite Identification | 447 |
A New Succinct Representation of RMQInformation and Improvements in the Enhanced Suffix Array | 459 |
Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem | 471 |
Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach | 483 |
A New Load Balanced Routing Algorithm for Torus Networks | 495 |
Optimal Semionline Scheduling Algorithms on aSmall Number of Machines | 504 |
Lower Bounds on Edge Searching | 516 |
Author Index | 528 |
Citi izdevumi - Skatīt visu
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies ... Bo Chen Ierobežota priekšskatīšana - 2007 |
Bieži izmantoti vārdi un frāzes
alignment ALL-PAIRS approximation algorithm assigned bandwidth Berlin Heidelberg 2007 bin packing problem bins Chen color competitive ratio Computer consider constraint contains copula cost cost(A critical clique cubic graph cycle dags defined denote edge encoded Equation function given graph G greedy algorithm Hamming distance heuristic integer interval graphs k-tree labeled least Lemma linear LNCS lower bound machine method Min-Max Min-Sum minimize minimum risk-sum path Nash equilibrium nodes NP-complete NP-hard null space obtain on-line online algorithm optimal solution packing pair paper parameter partitioning phase polynomial present Proof random rejection request risk-sum path problem routing satisfies scheduling scheme searcher secret sharing sequence shortest path problem solve space Springer step strategy stream subgraph subset Theorem tree update variable vector vertex watermark weighted Zhang Eds