article

On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems

Authors:

C. A. J. Hurkens,

A. SchrijverAuthors Info & Claims

SIAM Journal on Discrete Mathematics, Volume 2, Issue 1

Pages 68 - 72

https://doi.org/10.1137/0402008

Published: 01 February 1989 Publication History

Abstract

No abstract available.

Cited By

View all

Marchetti KSevaljevic ADiviney AEardley CPhillips RKhadka RIgbokwe DBodily PMonga MLonati VBarendsen ESheard JPaterson J(2024)Redux: An Interactive, Dynamic Knowledge Base for Teaching NP-completenessProceedings of the 2024 on Innovation and Technology in Computer Science Education V. 110.1145/3649217.3653544(255-261)Online publication date: 3-Jul-2024
https://dl.acm.org/doi/10.1145/3649217.3653544
Xi WLin W(2024)The maximum 3-star packing problem in claw-free cubic graphsJournal of Combinatorial Optimization10.1007/s10878-024-01115-z47:5Online publication date: 18-May-2024
https://dl.acm.org/doi/10.1007/s10878-024-01115-z
Neuwohner M(2024)The limits of local search for weighted k-set packingMathematical Programming: Series A and B10.1007/s10107-023-02026-3206:1-2(389-427)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1007/s10107-023-02026-3
Show More Cited By

Index Terms

On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Complexity on some bin packing problems
Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures

<P>We consider the famous bin packing problem where a set of items must be stored in bins of equal capacity. In the classical version, the objective is to minimize the number of bins used. Motivated by several optimization problems that occur in the ...
The relative worst order ratio for online algorithms

We define a new measure for the quality of online algorithms, the relative worst order ratio, using ideas from the max/max ratio [Ben-David and Borodin 1994] and from the random order ratio [Kenyon 1996]. The new ratio is used to compare online ...

Comments

Information & Contributors

Information

Published In

cover image SIAM Journal on Discrete Mathematics

SIAM Journal on Discrete Mathematics Volume 2, Issue 1

February 1989

143 pages

ISSN:0895-4801

Editor:
W. T. Trotter

Issue’s Table of Contents

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 February 1989

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

119
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Marchetti KSevaljevic ADiviney AEardley CPhillips RKhadka RIgbokwe DBodily PMonga MLonati VBarendsen ESheard JPaterson J(2024)Redux: An Interactive, Dynamic Knowledge Base for Teaching NP-completenessProceedings of the 2024 on Innovation and Technology in Computer Science Education V. 110.1145/3649217.3653544(255-261)Online publication date: 3-Jul-2024
https://dl.acm.org/doi/10.1145/3649217.3653544
Xi WLin W(2024)The maximum 3-star packing problem in claw-free cubic graphsJournal of Combinatorial Optimization10.1007/s10878-024-01115-z47:5Online publication date: 18-May-2024
https://dl.acm.org/doi/10.1007/s10878-024-01115-z
Neuwohner M(2024)The limits of local search for weighted k-set packingMathematical Programming: Series A and B10.1007/s10107-023-02026-3206:1-2(389-427)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1007/s10107-023-02026-3
Levin A(2024)The Near Exact Bin Covering ProblemAlgorithmica10.1007/s00453-024-01224-586:6(2041-2066)Online publication date: 1-Jun-2024
https://dl.acm.org/doi/10.1007/s00453-024-01224-5
Zhao JXiao M(2024)An Improved Approximation Algorithm for Metric Triangle PackingTheory and Applications of Models of Computation10.1007/978-981-97-2340-9_5(50-62)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1007/978-981-97-2340-9_5
Brito KAlexandrino ASiqueira GOliveira ADias UDias Z(2024)Maximum Alternating Balanced Cycle Decomposition and Applications in Sorting by Intergenic Operations ProblemsComparative Genomics10.1007/978-3-031-58072-7_8(153-172)Online publication date: 27-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-58072-7_8
Xi WLin W(2023)The Maximum 4-Vertex-Path Packing of a Cubic Graph Covers At Least Two-Thirds of Its VerticesGraphs and Combinatorics10.1007/s00373-023-02732-x40:1Online publication date: 20-Dec-2023
https://dl.acm.org/doi/10.1007/s00373-023-02732-x
Sheng ZXiao M(2023)A Discharging Method: Improved Kernels for Edge Triangle Packing and CoveringComputing and Combinatorics10.1007/978-3-031-49193-1_13(171-183)Online publication date: 15-Dec-2023
https://dl.acm.org/doi/10.1007/978-3-031-49193-1_13
Fang CSong SMei YYuan YWang JZhang ARangwala H(2022)On Aligning Tuples for RegressionProceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3534678.3539373(336-346)Online publication date: 14-Aug-2022
https://dl.acm.org/doi/10.1145/3534678.3539373
Neuwohner M(2022)The Limits of Local Search for Weighted k-Set PackingInteger Programming and Combinatorial Optimization10.1007/978-3-031-06901-7_31(415-428)Online publication date: 27-Jun-2022
https://dl.acm.org/doi/10.1007/978-3-031-06901-7_31
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Complexity on some bin packing problems

Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures

The relative worst order ratio for online algorithms

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations