Testing of Heuristic Methods: A Case Study of Greedy Algorithm
- DOI
- 10.1007/978-3-642-22386-0_19
- Published
- 2011
- Container
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Open access
- unknown
Credibility signals
uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.
Show all credibility signals
- supportingDOI registered: A matching record was returned by Crossref.
- supportingDOI resolves: A matching record was returned by Crossref.
- not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility.
- not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made.
- not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made.
- not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made.
- not scoredROR affiliation: Not checked or no result supplied; no credibility inference made.
- not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredOpen access status: Not checked or no result supplied; no credibility inference made.
- not scoredPublication license: Not checked or no result supplied; no credibility inference made.
- not scoredPublication version: A publication version was supplied but is not scored.
- supportingMetadata completeness: All 6 scored descriptive metadata groups are present.
Cite this work
BibTeX
@article{allodium:10.1007/978-3-642-22386-0_19,
title = {Testing of Heuristic Methods: A Case Study of Greedy Algorithm},
author = {A. C. Barus and T. Y. Chen and D. Grant and F. -C. Kuo and M. F. Lau},
year = {2011},
journal = {Lecture Notes in Computer Science},
doi = {10.1007/978-3-642-22386-0_19},
url = {https://doi.org/10.1007/978-3-642-22386-0_19}
}RIS
TY - JOUR TI - Testing of Heuristic Methods: A Case Study of Greedy Algorithm AU - A. C. Barus AU - T. Y. Chen AU - D. Grant AU - F. -C. Kuo AU - M. F. Lau PY - 2011 JO - Lecture Notes in Computer Science DO - 10.1007/978-3-642-22386-0_19 UR - https://doi.org/10.1007/978-3-642-22386-0_19 ER -
APA
Barus, A. C., Chen, T. Y., Grant, D., Kuo, F. -., & Lau, M. F. (2011). Testing of Heuristic Methods: A Case Study of Greedy Algorithm. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-22386-0_19
Source records
- crossref · retrieved 2026-09-25T11:12:38.860Z