Testing of Heuristic Methods: A Case Study of Greedy Algorithm

A. C. Barus, T. Y. Chen, D. Grant, F. -C. Kuo, M. F. Lau

Open source

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

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