scientific article; zbMATH DE number 1445376
From MaRDI portal
Publication:4952699
zbMath0957.68084MaRDI QIDQ4952699
Gabriel Robins, Alexander Z. Zelikovsky
Publication date: 10 May 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (84)
On residual approximation in solution extension problems ⋮ Reoptimization of Steiner trees: changing the terminal set ⋮ Load balanced distributed directories ⋮ Welfare Maximization with Deferred Acceptance Auctions in Reallocation Problems ⋮ A survey on combinatorial optimization in dynamic environments ⋮ A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes ⋮ A better constant-factor approximation for selected-internal Steiner minimum tree ⋮ Node-weighted Steiner tree approximation in unit disk graphs ⋮ Improved algorithms for joint optimization of facility locations and network connections ⋮ Approximation schemes for node-weighted geometric Steiner tree problems ⋮ Computing optimal Steiner trees in polynomial space ⋮ Directed Steiner trees with diffusion costs ⋮ A factoring approach for the Steiner tree problem in undirected networks ⋮ The density maximization problem in graphs ⋮ On the low-dimensional Steiner minimum tree problem in Hamming metric ⋮ On the approximability of dense Steiner problems ⋮ An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 ⋮ Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem ⋮ On Residual Approximation in Solution Extension Problems ⋮ Two-stage robust network design with exponential scenarios ⋮ On the approximability of the Steiner tree problem. ⋮ Steiner tree reoptimization in graphs with sharpened triangle inequality ⋮ Improved approximation algorithms for directed Steiner forest ⋮ Construction of systematic \((k+1,k)\) memory MDS sliding window codes over embedded fields ⋮ Approximating Alternative Solutions ⋮ (1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree ⋮ Approximating the Generalized Capacitated Tree-Routing Problem ⋮ Reoptimization of Steiner Trees ⋮ Approximating capacitated tree-routings in networks ⋮ Maximum series-parallel subgraph ⋮ Approximation algorithms for priority Steiner tree problems ⋮ Minimum diameter cost-constrained Steiner trees ⋮ Wireless networking, dominating and packing ⋮ Connected facility location via random facility sampling and core detouring ⋮ On the edge capacitated Steiner tree problem ⋮ Approximation algorithms for general packing problems and their application to the multicast congestion problem ⋮ Fast approximation of minimum multicast congestion – Implementation VERSUS Theory ⋮ Faster Steiner Tree Computation in Polynomial-Space ⋮ Differential approximation results for the Steiner tree problem ⋮ Approximation to the Minimum Cost Edge Installation Problem ⋮ Inapproximability and approximability of minimal tree routing and coloring ⋮ On routing in VLSI design and communication networks ⋮ A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems ⋮ On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric ⋮ The Steiner tree problem on graphs: inapproximability results ⋮ Cost-sharing mechanisms for network design ⋮ Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs ⋮ An improved approximation algorithm for capacitated multicast routings in networks ⋮ Trade-offs on the location of the core node in a network ⋮ On the minimum number of wavelengths in multicast trees in WDM networks ⋮ Distributed transactional memory for general networks ⋮ A near linear time approximation scheme for Steiner tree among obstacles in the plane ⋮ Cooperative TSP ⋮ Inapproximability and approximability of maximal tree routing and coloring ⋮ On the approximation of the generalized capacitated tree-routing problem ⋮ Probabilistic models for the Steiner Tree problem ⋮ Network flow spanners ⋮ On the Hardness of Reoptimization ⋮ Approximating the selected-internal Steiner tree ⋮ On Rajagopalan and Vazirani's \(\frac{3}{2}e\)-approximation bound for the iterated 1-Steiner heuristic ⋮ A note on the terminal Steiner tree problem ⋮ Approximation algorithms for connected facility location problems ⋮ Packing trees in communication networks ⋮ Non-cooperative tree creation ⋮ Approaches to the Steiner Problem in Networks ⋮ Multicast Routing and Design of Sparse Connectors ⋮ Approximation algorithms for soft-capacitated facility location in capacitated network design ⋮ Improved approximation algorithms for the single-sink buy-at-bulk network design problems ⋮ Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation ⋮ On approximation algorithms for the terminal Steiner tree problem ⋮ New Reoptimization Techniques applied to Steiner Tree Problem ⋮ A 3.4713-approximation algorithm for the capacitated multicast tree routing problem ⋮ A 6.55 factor primal-dual approximation algorithm for the connected facility location problem ⋮ Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem ⋮ Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs ⋮ An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem ⋮ An improved approximation algorithm for multicast \(k\)-tree routing ⋮ Steiner trees in uniformly quasi-bipartite graphs. ⋮ On the terminal Steiner tree problem. ⋮ Unnamed Item ⋮ An approximation for minimum multicast route in optical networks with nonsplitting nodes ⋮ On full Steiner trees in unit disk graphs ⋮ On approximability of the independent/connected edge dominating set problems ⋮ A note on optical network with nonsplitting nodes
This page was built for publication:
