Year of publication
Type of media
Type of material
Licence
Language
1–20 of 41 hits
Sort by:
Sort by:
-
A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem
Online Contents | 2022|Keywords: k-prize-collecting Steiner tree, Prize-collecting Steiner tree -
A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem
Online Contents | 2022|Keywords: k-prize-collecting Steiner tree, Prize-collecting Steiner tree -
Reduction techniques for the prize collecting Steiner tree problem and the maximum‐weight connected subgraph problem
Wiley | 2019|Keywords: rooted prize‐collecting Steiner tree problem, prize‐collecting Steiner tree problem -
Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem
Elsevier | 2007|Keywords: Prize-collecting Steiner tree -
Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem
Free accessDataCite | 2014|Keywords: Prize-collecting Steiner Tree -
A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
Elsevier | 2005|Keywords: Prize collecting Steiner tree -
Online Constrained Forest and Prize-Collecting Network Design
Online Contents | 2017|Keywords: Prize-collecting Steiner tree -
A 5-approximation algorithm for the k-prize-collecting Steiner tree problem
Online Contents | 2017|Keywords: Prize-collecting Steiner tree -
Minimum Steiner trees on a set of concyclic points and their center
Wiley | 2022|Keywords: prize‐collecting Steiner tree -
Online Constrained Forest and Prize-Collecting Network Design
Online Contents | 2017|Keywords: Prize-collecting Steiner tree -
Solving the prize‐collecting Euclidean Steiner tree problem
Wiley | 2022|Keywords: prize‐collecting Steiner tree -
On imposing connectivity constraints in integer programs
Online Contents | 2017|Keywords: Prize-collecting Steiner tree -
Knowledge-guided local search for the prize-collecting Steiner tree problem in graphs
Elsevier | 2017|Keywords: Prize-collecting Steiner tree problem -
Improved Steiner tree algorithms for bounded treewidth
Elsevier | 2012|Keywords: (Prize-collecting) Steiner tree -
Elementary approximation algorithms for prize collecting Steiner tree problems
Elsevier | 2007|Keywords: Prize collecting Steiner tree problem -
Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem
Free accessBASE | 2014|Keywords: Prize-collecting Steiner Tree -
Risk models for the Prize Collecting Steiner Tree problems with interval data
Online Contents | 2014|Keywords: prize collecting Steiner tree -
A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem
Springer Verlag | 2020|Keywords: k-prize-collecting Steiner tree, Prize-collecting steiner tree -
A 4-approximation algorithm for k-prize collecting Steiner tree problems
Online Contents | 2018|Keywords: -prize collecting Steiner tree problems -
Risk models for the Prize Collecting Steiner Tree problems with interval data
Online Contents | 2014|Keywords: prize collecting Steiner tree
Send my search to (beta)
Send your search query (search terms without filters) to other databases, portals and catalogues to find more interesting hits.
Dimensions:
full data search
or
title and abstract search
Dimensions is a database for abstracts and citations that links information on research funding with the resulting publications, studies and patents.
TIB AV portal
In the TIB AV-Portal, audiovisual media from science and teaching can be foundand own scientific videos can be published.
Specialised Information Service for Mobility and Transport Research (FID move)
Open Research Knowledge Graph (ORKG)
The FID move can be used to search for subject-specific literature, research data and other information from mobility and transport research.
The Open Research Knowledge Graph provides structured descriptions of research content and makes it comparable.
Common Union Catalogue (GVK)
Freely accessible part of the collaborative K10plus catalogue with materials relevant for interlibrary loan and direct delivery services.