Plesnk Jn

Jn Plesnk

Information about the author Jn Plesnk will soon be added to the site.
Found 2 papers in total
The Steiner tree problem in graphs: Worst case examples for insertion heuristics
The Steiner tree problem in graphs: Worst case examples for insertion heuristics
1999
Given a graph G with positive edge costs and a subset R of required vertices, the...
Constrained weighted matchings and edge coverings in graphs
Constrained weighted matchings and edge coverings in graphs
1999
We introduce the problem of finding a maximum weight matching in a graph such that the...
Papers per page: