scientific article; zbMATH DE number 742978
From MaRDI portal
Publication:4763417
Recommendations
- Approximating the Minimum-Degree Steiner Tree to within One of Optimal
- Approximating minimum bounded degree spanning trees to within one of optimal
- A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
- A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees
- scientific article; zbMATH DE number 2081108
Cited in
(47)- Labeling schemes for tree representation
- Approximating the maximum internal spanning tree problem
- On the approximability of some Maximum Spanning Tree Problems
- Lexicographic local search and the \(p\)-center problem.
- ILP formulation of the degree-constrained minimum spanning hierarchy problem
- Refuting a conjecture of goemans on bounded degree spanning trees
- Approximating the degree-bounded minimum diameter spanning tree problem
- A note on line broadcast in digraphs under the edge-disjoint paths mode
- Near-linear time algorithm for approximate minimum degree spanning trees
- Approximating spanning trees with few branches
- Spanning trees with minimum weighted degrees
- A natural family of optimization problems with arbitrarily small approximation thresholds
- THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS
- scientific article; zbMATH DE number 989714 (Why is no real title available?)
- A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
- A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees
- Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results
- Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs
- Bounded-degree minimum-radius spanning trees in wireless sensor networks
- Approximating the Minimum-Degree Steiner Tree to within One of Optimal
- On the approximability of some degree-constrained subgraph problems
- scientific article; zbMATH DE number 2081108 (Why is no real title available?)
- Fast gossiping by short messages
- Approximation algorithms for finding low-degree subgraphs
- scientific article; zbMATH DE number 1563034 (Why is no real title available?)
- scientific article; zbMATH DE number 1859295 (Why is no real title available?)
- Low-Degree Spanning Trees of Small Weight
- On approximating the longest path in a graph
- On the approximability of some maximum spanning tree problems
- Approximation of the degree-constrained minimum spanning hierarchies
- Approximating minimum bounded degree spanning trees to within one of optimal
- Low-port tree representations
- Approximating the degree-bounded minimum diameter spanning tree problem
- Structure in approximation classes
- New approximation results on graph matching and related problems
- Self-stabilizing minimum degree spanning tree within one from the optimal degree
- Constrained flows in networks
- Distributed hierarchical search for balanced energy consumption routing spanning trees in wireless sensor networks
- On approximating the longest path in a graph
- Approximating maximum-size properly colored forests
- On sparse hitting sets: from fair vertex cover to highway dimension
- Approximating maximum-size properly colored forests
- Bounded degree spanning trees (extended abstract)
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem
- Finding large cycles in Hamiltonian graphs
- Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763417)
