Skip to content
Book Bag:
0
items
(Full)
Login
Language
English
Slovak
Catalog
Catalog Books
Articles
Catalog ONDV
Catalog OND
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Find
Advanced
WORST-CASE RELATIVE PERFORMANC...
Cite this
Print
Export Record
Export to MARC
Export to BibTeX
Export to Jednoduchý textový výpis
Export to ISBD (text)
Export to Citácia ISO 690 (HTML)
Export to Citácia ISO 690 (.doc)
Add to Book Bag
Remove from Book Bag
Permanent link
WORST-CASE RELATIVE PERFORMANCES OF HEURISTICS FOR THE STEINER PROBLEM IN GRAPHS
Bibliographic Details
Main Author:
Plesník, J.
(Author)
Format:
Article
Language:
English
Pozri predplatné
Predplatné
Kliknite na „Pozri predplatné“.
Holdings
Description
Similar Items
Staff View
Similar Items
THREE NEW HEURISTICS FOR THE STEINER PROBLEM IN GRAPHS
by: Plesník, J., et al.
Worst-case analysis of a greedy heuristic for optimum matchings in graphs
by: Plesník, Ján, 1925-
A BOUND FOR THE STEINER TREE PROBLEM IN GRAPHS
by: Plesník, Ján, 1943-
Two heuristics for the absolute p-center problem in graphs
by: Plesník, Ján, 1943-
Two heuristics for the absolute p-center problem in graphs
by: Plesník, Ján, 1943-
