On the complexity of finding 1-center spanning trees
From MaRDI portal
Cites work
- A linear-time algorithm for the 1-mismatch problem
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- Can you solve closest string faster than exhaustive search?
- Distinguishing string selection problems.
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1305511 (Why is no real title available?)
- scientific article; zbMATH DE number 1305522 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- scientific article; zbMATH DE number 7650919 (Why is no real title available?)
- Inapproximability results for bounded variants of optimization problems.
- Multi-Terminal Network Flows
- New maximal two-distance sets
- On approximation properties of the Independent set problem for degree 3 graphs
- On complexity of 1-center in various metrics
- On covering problems of codes
- On the closest string and substring problems
- On the complexity of k-SAT
- Spanning Trees and Optimization Problems
- Spanning Trees with Many Leaves
- Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
- Spanning trees with many or few colors in edge-colored graphs
- Which problems have strongly exponential complexity?
This page was built for publication: On the complexity of finding 1-center spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312595)
