scientific article; zbMATH DE number 742978
From MaRDI portal
Publication:4763417
zbMath0829.68097MaRDI QIDQ4763417
Balaji Raghavachari, Martin Fuerer
Publication date: 11 April 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (24)
A natural family of optimization problems with arbitrarily small approximation thresholds ⋮ ILP formulation of the degree-constrained minimum spanning hierarchy problem ⋮ Spanning trees with minimum weighted degrees ⋮ Bounded-degree minimum-radius spanning trees in wireless sensor networks ⋮ On the approximability of some maximum spanning tree problems ⋮ On the approximability of some Maximum Spanning Tree Problems ⋮ Structure in approximation classes ⋮ New approximation results on graph matching and related problems ⋮ Lexicographic local search and the \(p\)-center problem. ⋮ Self-stabilizing minimum degree spanning tree within one from the optimal degree ⋮ On the approximability of some degree-constrained subgraph problems ⋮ A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem ⋮ Distributed hierarchical search for balanced energy consumption routing spanning trees in wireless sensor networks ⋮ Fast gossiping by short messages ⋮ On approximating the longest path in a graph ⋮ Approximation algorithms for finding low-degree subgraphs ⋮ A note on line broadcast in digraphs under the edge-disjoint paths mode ⋮ Finding large cycles in Hamiltonian graphs ⋮ On approximating the longest path in a graph ⋮ Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs ⋮ Degree-Constrained Subgraph Problems: Hardness and Approximation Results ⋮ Labeling schemes for tree representation ⋮ Approximating the maximum internal spanning tree problem ⋮ Approximating spanning trees with few branches
This page was built for publication:
