One tree optimization problem
On given graph with single out (central) vertex needed to find tree of minimum cost. For every edge two numbers are assigned: {open_quotes}weight{close_quotes} and {open_quotes}length{close_quotes} and for some set of vertices value of flow from everyone to central vertex are given. Weight of edge in tree count up in cost sum once and length - so many times as value of edge flow. Such problem often considered respect to telephone networks design. The considered problem is NP-hard. Because of this in the work considered polynomial approximate algorithms and estimated the value of relative error for class of problems in the worst case. Moreover, some special cases, when it succeeded to construct exact solution by polynomial time, are considered.
- OSTI ID:
- 35986
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
The Approximability of Partial Vertex Covers in Trees.
Improving minimum cost spanning trees by upgrading nodes