# --------------------------------------------
# CITATION file created with {cffr} R package
# See also: https://docs.ropensci.org/cffr/
# --------------------------------------------
 
cff-version: 1.2.0
message: 'To cite package "pcSteiner" in publications use:'
type: software
license: GPL-3.0-only
title: 'pcSteiner: Convenient Tool for Solving the Prize-Collecting Steiner Tree Problem'
version: 1.0.0
doi: 10.32614/CRAN.package.pcSteiner
abstract: The Prize-Collecting Steiner Tree problem asks to find a subgraph connecting
  a given set of vertices with the most expensive nodes and least expensive edges.
  Since it is proven to be NP-hard, exact and efficient algorithm does not exist.
  This package provides convenient functionality for obtaining an approximate solution
  to this problem using loopy belief propagation algorithm.
authors:
- family-names: Krasikov
  given-names: Aleksei
  email: krasikov.as@phystech.edu
repository: https://krashkov.r-universe.dev
repository-code: https://github.com/krashkov/pcSteiner
commit: b62b9901f5ac26a4c8c3f33a288a0685f971559d
url: https://github.com/krashkov/pcSteiner
date-released: '2020-08-21'
contact:
- family-names: Krasikov
  given-names: Aleksei
  email: krasikov.as@phystech.edu