A linear-time approximation algorithm for the minimum-length geometric embedding of trees
From MaRDI portal
Cites work
- 2-colored point-set embeddings of partial 2-trees
- A lower bound for metric 1-median selection
- Approximating the bandwidth via volume respecting embeddings
- Bipartite embeddings of trees in the plane
- Combinatorial theorems about embedding trees on the real line
- Constrained point set embedding of a balanced binary tree
- Deterministic metric 1-median selection with A 1-o(1) fraction of points ignored
- Disjoint Paths—A Survey
- Drawing colored graphs on colored points
- Embedding planar graphs at fixed vertex locations
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Fast geometric approximation techniques and geometric embedding problems
- scientific article; zbMATH DE number 431516 (Why is no real title available?)
- scientific article; zbMATH DE number 4173000 (Why is no real title available?)
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 2145233 (Why is no real title available?)
- Inserting one edge into a simple drawing is hard
- Interval graphs and searching
- k-colored Point-set Embeddability of Outerplanar Graphs
- Linear-time approximation schemes for clustering problems in any dimensions
- Metric 1-median selection: query complexity vs. approximation ratio
- Minimum height path partitioning of trees
- ON EMBEDDING A GRAPH ON TWO SETS OF POINTS
- On embedding an outer-planar graph in a point set
- On embedding triconnected cubic graphs on point sets
- On the curve complexity of 3-colored point-set embeddings
- Optimal point-set embedding of wheel graphs and a sub-class of 3-trees
- Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
- Planar embedding of trees on point sets without the general position assumption
- Planar straight-line point-set embedding of trees with partial embeddings
- Point-Set Embedding of Trees with Edge Constraints
- Point-set embeddings of trees with given partial drawings
- SEMI-BALANCED PARTITIONS OF TWO SETS OF POINTS AND EMBEDDINGS OF ROOTED FORESTS
- Simple alternating path problem
- Straight line embeddings of rooted star forests in the plane
- Sublinear time algorithms for metric space problems
- The Euclidean traveling salesman problem is NP-complete
- The rooted tree embedding problem into points in the plane
- Two results on linear embeddings of complete binary trees
- Well-separated pair decomposition in linear time?
- Worst-case analysis of a new heuristic for the travelling salesman problem
This page was built for publication: A linear-time approximation algorithm for the minimum-length geometric embedding of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982782)
