The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
On the Complexity of Timetable and Multicommodity Flow Problems
Abstract
A very primitive version of Gotlieb’s timetable problem is shown to be NP-complete, and therefore all the common timetable problems are NP-complete. A polynomial time algorithm, in case all teachers are binary, is shown. The theorem that a meeting function always exists if all teachers and classes have no time constraints is proved. The multicommodity integral flow problem is shown to be NP-complete even if the number of commodities is two. This is true both in the directed and undirected cases.
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
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Hopcroft, J. E., & Karp, R. M. (1973) · SIAM Journal on Computing · doi:10.1137/0202019 · Cited by 2,802
A Computing Procedure for Quantification Theory
Davis, M., & Putnam, H. (1960) · Journal of the ACM · doi:10.1145/321033.321034 · Cited by 2,647
Hall, P. (1935) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-10.37.26 · Cited by 1,954
On the Computational Complexity of Combinatorial Problems
Karp, R. M. (1975) · Networks · doi:10.1002/net.1975.5.1.45 · Cited by 711
Cited by
Hedera: dynamic flow scheduling for data center networks
Al-Fares, M., Radhakrishnan, S., Raghavan, B., Huang, N., & Vahdat, A. M. (2010) · doi:10.5555/1855711.1855730 · Cited by 1,450
The Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
Raghavan, P., & Tompson, C. D. (1987) · Combinatorica · doi:10.1007/bf02579324 · Cited by 1,010
A linear-time algorithm for testing the truth of certain quantified boolean formulas
Aspvall, B., Plass, M. F., & Tarjan, R. E. (1979) · Information Processing Letters · doi:10.1016/0020-0190(79)90002-4 · Cited by 892
A Survey of Automated Timetabling
Schaerf, A. (1999) · Artificial Intelligence Review · doi:10.1023/a:1006576209967 · Cited by 654
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
Bellare, M., Goldreich, O., & Sudan, M. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539796302531 · Cited by 453
A simplified NP-complete satisfiability problem
Tovey, C. A. (1984) · Discrete Applied Mathematics · doi:10.1016/0166-218x(84)90081-7 · Cited by 382
Primal-dual approximation algorithms for integral flow and multicut in trees
Garg, N., Vazirani, V. V., & Yannakakis, M. (1997) · Algorithmica · doi:10.1007/bf02523685 · Cited by 378
Equivalences Among Relational Expressions with the Union and Difference Operators
Sagiv, Y., & Yannakakis, M. (1980) · Journal of the ACM · doi:10.1145/322217.322221 · Cited by 369
Algorithms for the maximum satisfiability problem
Hansen, P., & Jaumard, B. (1990) · Computing · doi:10.1007/bf02241270 · Cited by 360
Free bits, PCPs and non-approximability-towards tight results
Bellare, M., Goldreich, O., & Sudan, M. (2002) · Proceedings of IEEE 36th Annual Foundations of Computer Science · doi:10.1109/sfcs.1995.492573 · Cited by 265
Rossi, F., Zhang, R., Hindy, Y., & Pavone, M. (2018) · Autonomous Robots · doi:10.1007/s10514-018-9750-5 · Cited by 153
EFFICIENT RECONSTRUCTION OF HAPLOTYPE STRUCTURE VIA PERFECT PHYLOGENY
ESKIN, E., HALPERIN, E., & KARP, R. M. (2003) · Journal of Bioinformatics and Computational Biology · doi:10.1142/s0219720003000174 · Cited by 131
Babbush, R., Perdomo‐Ortiz, A., O'Gorman, B., Macready, W., & Aspuru‐Guzik, A. (2014) · Advances in Chemical Physics · doi:10.1002/9781118755815.ch05 · Cited by 45
QED driven QAOA for network-flow optimization
Zhang, Y., Zhang, R., & Potter, A. C. (2021) · Quantum · doi:10.22331/q-2021-07-27-510 · Cited by 19
Metadata
- Authors
- Even, S., Itai, A., & Shamir, A.
- Venue
- SIAM Journal on Computing
- Published
- 1976-12
- Volume
- 5
- Issue
- 4
- Pages
- 691-703
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2003160050
- Cited by
- 1,057
- References
- 6
- FWCI
- 5.90
- Type
- journal article
- Language
- en
- Open access
- closed
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.