Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

SIAM Journal on Computing - United States
doi 10.1137/0203025
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

On Domain-Partitioning Induction Criteria: Worst-Case Bounds for the Worst-Case Based

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2004English

Tight Worst-Case Bounds for Polynomial Loop Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Tight Performance Bounds in the Worst-Case Analysis of Feed-Forward Networks

Discrete Event Dynamic Systems: Theory and Applications
ControlElectronic EngineeringSystems EngineeringSimulationElectricalModeling
2015English

One-Dimensional Heuristics Adapted for Two-Dimensional Rectangular Strip Packing

Journal of the Operational Research Society
ManagementProbabilityMarketingUncertaintySimulationManagement ScienceStatisticsManagement Information SystemsModelingStrategyOperations Research
2008English

Two-Dimensional Packing Algorithms for Layout of Disconnected Graphs

Information Sciences
ControlSystems EngineeringManagementTheoretical Computer ScienceComputer Science ApplicationsInformation SystemsArtificial IntelligenceSoftware
2002English

Worst-Case Large Deviations Upper Bounds for i.i.d. Sequencesunder Ambiguity

Turkish Journal of Mathematics
Mathematics
2018English

Improved Algorithms for Edit Distance and LCS: Beyond Worst Case

2020English

Lower Bounds for One-To-One Packet Routing on Trees Using Hot-Potato Algorithms

Computer Journal
Computer Science
2002English

On the Worst-Case Behavior of String-Searching Algorithms

SIAM Journal on Computing
MathematicsComputer Science
1977English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy