Pages that link to "Item:Q3611890"

The following pages link to Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Q3611890):

Displaying 43 items.

• The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9 (Q3611891) (← links)
• Sequential Vector Packing (Q3611892) (← links)
• A Tighter Analysis of Set Cover Greedy Algorithm for Test Set (Q3611893) (← links)
• A More Effective Linear Kernelization for Cluster Editing (Q3611894) (← links)
• CR-precis: A Deterministic Summary Structure for Update Data Streams (Q3611895) (← links)
• An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning (Q3611897) (← links)
• On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems (Q3611898) (← links)
• A Digital Watermarking Scheme Based on Singular Value Decomposition (Q3611899) (← links)
• A New (t,n) −Threshold Scheme Based on Difference Equations (Q3611900) (← links)
• Clique-Transversal Sets in Cubic Graphs (Q3611901) (← links)
• On the L(h,k)-Labeling of Co-comparability Graphs (Q3611902) (← links)
• An Approximation Algorithm for the General Mixed Packing and Covering Problem (Q3611903) (← links)
• Extending the Hardness of RNA Secondary Structure Comparison (Q3611904) (← links)
• On the On-Line Weighted k-Taxi Problem (Q3611905) (← links)
• Model Futility and Dynamic Boundaries with Application in Banking Default Risk Modeling (Q3611906) (← links)
• On the Minimum Risk-Sum Path Problem (Q3611907) (← links)
• Constrained Cycle Covers in Halin Graphs (Q3611908) (← links)
• Optimal Semi-online Algorithms for Scheduling with Machine Activation Cost (Q3611909) (← links)
• A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection (Q3611910) (← links)
• Online Coupon Consumption Problem (Q3611911) (← links)
• Application of Copula and Copula-CVaR in the Multivariate Portfolio Optimization (Q3611913) (← links)
• Energy Efficient Heuristic Scheduling Algorithms for Multimedia Service (Q3611914) (← links)
• Call Control and Routing in SONET Rings (Q3611916) (← links)
• Fast Matching Method for DNA Sequences (Q3611917) (← links)
• All-Pairs Ancestor Problems in Weighted Dags (Q3611919) (← links)
• Streaming Algorithms for Data in Motion (Q3611920) (← links)
• A Scheduling Problem with One Producer and the Bargaining Counterpart with Two Producers (Q3611921) (← links)
• Phrase-Based Statistical Language Modeling from Bilingual Parallel Corpus (Q3611922) (← links)
• Optimal Commodity Distribution for a Vehicle with Fixed Capacity Under Vendor Managed Inventory (Q3611924) (← links)
• On-Line Bin Packing with Arbitrary Release Times (Q3611925) (← links)
• On the Complexity of the Max-Edge-Coloring Problem with Its Variants (Q3611926) (← links)
• Quantitative Analysis of Multi-hop Wireless Networks Using a Novel Paradigm (Q3611927) (← links)
• Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance (Q3611928) (← links)
• Robust Optimization Model for a Class of Uncertain Linear Programs (Q3611929) (← links)
• An Efficient Algorithm for Solving the Container Loading Problem (Q3611930) (← links)
• A Bijective Code for k-Trees with Linear Time Encoding and Decoding (Q3611931) (← links)
• A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array (Q3611932) (← links)
• Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem (Q3611933) (← links)
• Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach (Q3611934) (← links)
• A New Load Balanced Routing Algorithm for Torus Networks (Q3611937) (← links)
• Optimal Semi-online Scheduling Algorithms on a Small Number of Machines (Q3611938) (← links)
• Lower Bounds on Edge Searching (Q3611939) (← links)
• Online Capacitated Interval Coloring (Q5901463) (← links)