Keyword: Steiner problem

Found 72 papers in total
On Steiner centers and Steiner medians of graphs
On Steiner centers and Steiner medians of graphs
1999,
Let G be connected graph and S a set of vertices of G . Then a Steiner tree for S is a...
A branch and cut algorithm for the Steiner problem in graphs
A branch and cut algorithm for the Steiner problem in graphs
1998,
In this paper, we consider the Steiner problem in graphs, which is the problem of...
A strong lower bound for the node weighted Steiner tree problem
A strong lower bound for the node weighted Steiner tree problem
1998,
In this paper, we study the Node Weighted Steiner Tree Problem (NSP). This problem is...
Euclidean Steiner minimum trees: An improved exact algorithm
Euclidean Steiner minimum trees: An improved exact algorithm
1997,
The Euclidean Steiner tree problem asks for a shortest network interconnecting a set...
Vertex-disjoint packing of two Steiner trees: Polyhedra and branch-and-cut
Vertex-disjoint packing of two Steiner trees: Polyhedra and branch-and-cut
2001,
Consider the problem of routing the electrical connections among two large terminal...
An approximation scheme for some Steiner tree problems in the plane
An approximation scheme for some Steiner tree problems in the plane
1996,
We design a polynomial-time approximation scheme for the Steiner tree problem in the...
A modified Melzak procedure for computing node-weighted Steiner trees
A modified Melzak procedure for computing node-weighted Steiner trees
1996,
Given a set of points in the Euclidean plane, the standard Steiner Problem asks for a...
Quadratic set packing problems, Steiner trees, and their integration
Quadratic set packing problems, Steiner trees, and their integration
2000,
The complex problem of designing the layout and location of activities and the flow...
Simulation of wet film evolution and the Euclidean Steiner problem
Simulation of wet film evolution and the Euclidean Steiner problem
1999,
The Steiner problem asks for the shortest network that spans a given set of fixed...
Steiner Minimal Trees
Steiner Minimal Trees
1998,
Effective local search techniques for the Steiner tree problem
Effective local search techniques for the Steiner tree problem
1997,
We present a number of local search algorithms for the Steiner problem in graphs. The...
Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints
Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints
1998,
We use variable redefinition to strengthen a multicommodity flow (MCF) model for...
Improved computation of optimal rectilinear Steiner minimal trees
Improved computation of optimal rectilinear Steiner minimal trees
1997,
This paper presents two new algorithms for computing optimal rectilinear Steiner...
The Steiner tree packing problem in VLSI design
The Steiner tree packing problem in VLSI design
1997,
In this paper we describe several versions of the routing problem arising in VLSI...
Bottleneck Steiner subnetwork problems with k-connectivity constraints
Bottleneck Steiner subnetwork problems with k-connectivity constraints
1996,
The objective is to connect a given set of terminal nodes of a network by a subnetwork...
Upper-semi-continuity and cone-concavity of multi-valued vector functions in a duality theory for vector optimization
Upper-semi-continuity and cone-concavity of multi-valued vector functions in a duality theory for vector optimization
1997,
Following a few words on multifunctions in the mathematical literature, a very brief...
Optimal and approximate bottleneck Steiner trees
Optimal and approximate bottleneck Steiner trees
1996,
Given a set of terminals in the plane, a bottleneck Steiner tree is a tree...
A constrained Steiner tree problem
A constrained Steiner tree problem
1995,
The Steiner tree problem on a graph involves finding a minimum cost tree which...
Faster approximation algorithms for the rectilinear Steiner tree problem
Faster approximation algorithms for the rectilinear Steiner tree problem
1997,
The classical Steiner tree problem requires a shortest tree spanning a given vertex...
Packing Steiner trees: Polyhedral investigations
Packing Steiner trees: Polyhedral investigations
1996,
Let G=(V,E) be a graph and T⊆V be a node set. The authors call an edge set S a...
Packing Steiner trees: A cutting plane algorithnm and computational results
Packing Steiner trees: A cutting plane algorithnm and computational results
1996,
In this paper the authors describe a cutting plane algorithm for the Steiner tree...
Valid inequalities and facets for the Steiner problem in a directed graph
Valid inequalities and facets for the Steiner problem in a directed graph
1996,
This paper describes the facial structure of the Steiner problem in a directed graph...
Bottleneck Steiner subnetwork problems with k-connectivity constraints
Bottleneck Steiner subnetwork problems with k-connectivity constraints
1996,
The objective is to connect a given set of terminal nodes of a network by a subnetwork...
The Steiner problem I: Formulations, compositions and extension of facets
The Steiner problem I: Formulations, compositions and extension of facets
1994,
In this paper the authors give some integer programming formulations for the Steiner...
Papers per page: