The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
e-approximations with minimum packing constraint violation (extended abstract)
Open accessAbstract
We present efficient new randomized and deterministic methods for transforming optimal solutions for a type of relaxed integer linear program into provably good solutions for the corresponding NP-hard discrete optimization problem. Without any constraint violation, the ε-approximation problem for many problems of this type is itself NP-hard. Our methods provide polynomial-time ε-approximations while attempting to minimize the packing constraint violation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Cited by
Clustering data streams: theory and practice
Guha, S., Meyerson, A., Mishra, N., Motwani, R., & O'Callaghan, L. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1198387 · Cited by 882
An approximation algorithm for the generalized assignment problem
Shmoys, D. B., & Tardos, É. (1993) · Mathematical Programming · doi:10.1007/bf01585178 · Cited by 726
Scalable flow-based networking with DIFANE
Yu, M., Rexford, J., Freedman, M. J., & Wang, J. (2010) · Proceedings of the ACM SIGCOMM 2010 conference · doi:10.1145/1851182.1851224 · Cited by 525
Weighted random sampling with a reservoir
Efraimidis, P. S., & Spirakis, P. G. (2006) · Information Processing Letters · doi:10.1016/j.ipl.2005.11.003 · Cited by 353
Scalable flow-based networking with DIFANE
Yu, M., Rexford, J., Freedman, M. J., & Wang, J. (2010) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1851275.1851224 · Cited by 342
Metadata
- Authors
- Lin, J.-H., & Vitter, J. S.
- Venue
- Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92
- Publisher
- ACM Press
- Published
- 1992
- Pages
- 771-782
- OpenAlex
- W1991407520
- Cited by
- 215
- References
- 1
- FWCI
- 3.62
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.