Pages that link to "Item:Q4179026"
From MaRDI portal
The following pages link to The Rectilinear Steiner Tree Problem is $NP$-Complete (Q4179026):
Displayed 50 items.
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- On better heuristics for Steiner minimum trees (Q687085) (← links)
- The full Steiner tree problem (Q702772) (← links)
- Lower bounds for rectilinear Steiner trees in bounded space (Q750175) (← links)
- Edge-contraction problems (Q794164) (← links)
- Approximate min-max relations for odd cycles in planar graphs (Q877199) (← links)
- A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem (Q920030) (← links)
- Approximating the selected-internal Steiner tree (Q995588) (← links)
- Routing to reduce the cost of wavelength conversion (Q1005233) (← links)
- On the complexity of a family of generalized matching problems (Q1068535) (← links)
- Approximation algorithms for weighted matching (Q1102118) (← links)
- Two probabilistic results on rectilinear Steiner trees (Q1105495) (← links)
- On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three (Q1123898) (← links)
- On the removal of forbidden graphs by edge-deletion or by edge- contraction (Q1146698) (← links)
- The Steiner problem in phylogeny is NP-complete (Q1167073) (← links)
- Unit disk graphs (Q1174134) (← links)
- Routing in VLSI-layout (Q1179413) (← links)
- On Steiner ratio conjectures (Q1179751) (← links)
- The multi-weighted Steiner tree problem (Q1179753) (← links)
- The role of Steiner hulls in the solution to Steiner tree problems (Q1179758) (← links)
- An integrated approach to routing and via minimization (Q1183405) (← links)
- How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
- The rectilinear Steiner arborescence problem (Q1186802) (← links)
- Two new criteria for finding Steiner hulls in Steiner tree problems (Q1186803) (← links)
- Aperiodic tiles (Q1192608) (← links)
- Worst-case minimum rectilinear Steiner trees in all dimensions (Q1192611) (← links)
- The point-to-point delivery and connection problems: Complexity and algorithms (Q1193725) (← links)
- A heuristic for Euclidean and rectilinear Steiner problems (Q1194744) (← links)
- Flow network design for manufacturing systems layout (Q1197683) (← links)
- A fast and simple Steiner routing heuristic (Q1276958) (← links)
- Computing optimal rectilinear Steiner trees: A survey and experimental evaluation (Q1276966) (← links)
- Minimal connected enclosures on an embedded planar graph (Q1283782) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Stable sets in certain \(P_6\)-free graphs (Q1304476) (← links)
- Forests, colorings and acyclic orientations of the square lattice (Q1306612) (← links)
- Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study (Q1309809) (← links)
- Balancing problems in acyclic networks (Q1327220) (← links)
- The rectilinear class Steiner tree problem for intervals on two parallel lines (Q1327560) (← links)
- The Steiner ratio for the dual normed plane (Q1363707) (← links)
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees (Q1367169) (← links)
- The Steiner tree packing problem in VLSI design (Q1373751) (← links)
- The Steiner tree problem in orientation metrics (Q1384537) (← links)
- Deadlock prevention by acyclic orientations (Q1399106) (← links)
- SSTT: Efficient local search for GSI global routing (Q1412147) (← links)
- On the complexity of graph tree partition problems. (Q1421460) (← links)
- The Steiner ratio of high-dimensional Banach--Minkowski spaces. (Q1428549) (← links)
- A deep-submicron Steiner tree. (Q1597158) (← links)
- On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
- The allocation problem in hardware design (Q1801667) (← links)
- Minimum Steiner trees in normed planes (Q1802220) (← links)