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.
- A deep-submicron Steiner tree. (Q1597158) (← links)
- On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
- Some observations on holographic algorithms (Q1616615) (← links)
- \(\mathsf{NP}\)-hardness of geometric set cover and hitting set with rectangles containing a common point (Q1621499) (← links)
- Approximability and hardness of geometric hitting set with axis-parallel rectangles (Q1621500) (← links)
- Bottleneck bichromatic full Steiner trees (Q1628678) (← links)
- Safe sets in graphs: graph classes and structural parameters (Q1631677) (← links)
- A simple proof that the \((n^{2} - 1)\)-puzzle is hard (Q1637231) (← links)
- The repeater tree construction problem (Q1675870) (← links)
- Secluded connectivity problems (Q1679225) (← links)
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
- Minimum rectilinear Steiner tree of \(n\) points in the unit square (Q1699296) (← links)
- SCIP-Jack -- a solver for STP and variants with parallelization extensions (Q1699618) (← links)
- The convexity of induced paths of order three and applications: complexity aspects (Q1701089) (← links)
- The many facets of upper domination (Q1704853) (← links)
- A PSO-based timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction (Q1708730) (← links)
- Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology (Q1709982) (← links)
- An efficient heuristic algorithm for solving connected vertex cover problem (Q1720833) (← links)
- \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity (Q1731460) (← links)
- Complexity and algorithms for the connected vertex cover problem in 4-regular graphs (Q1735245) (← links)
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study (Q1741111) (← links)
- Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation (Q1755780) (← links)
- Network pollution games (Q1755784) (← links)
- Vertex deletion problems on chordal graphs (Q1786595) (← links)
- The allocation problem in hardware design (Q1801667) (← links)
- Minimum Steiner trees in normed planes (Q1802220) (← links)
- On the NP-hardness of edge-deletion and -contraction problems (Q1838829) (← links)
- Planar Manhattan local minimal and critical networks (Q1864609) (← links)
- A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints (Q1887939) (← links)
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues (Q1892937) (← links)
- On component-size bounded Steiner trees (Q1894356) (← links)
- A tight lower bound for the Steiner ratio in Minkowski planes (Q1896344) (← links)
- A new bound on the feedback vertex sets in cubic graphs (Q1910543) (← links)
- Packing Steiner trees: Polyhedral investigations (Q1919089) (← links)
- Packing Steiner trees: A cutting plane algorithm and computational results (Q1919090) (← links)
- Steiner minimal trees in \(L^ 2_ p\) (Q1923480) (← links)
- Inapproximability of the Tutte polynomial of a planar graph (Q1926110) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- Towards optimal kernel for connected vertex cover in planar graphs (Q1949125) (← links)
- PORA: a Physarum-inspired obstacle-avoiding routing algorithm for integrated circuit design (Q1988865) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- Dominating set of rectangles intersecting a straight line (Q2025079) (← links)
- Maximum independent sets near the upper bound (Q2026337) (← links)
- Algorithms and complexity for a class of combinatorial optimization problems with labelling (Q2031932) (← links)
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\) (Q2039643) (← links)
- Algorithmic aspects of 2-secure domination in graphs (Q2045038) (← links)
- Independent sets in \((P_4+P_4\),triangle)-free graphs (Q2053685) (← links)
- Extension and its price for the connected vertex cover problem (Q2072064) (← links)
- \(1\)-line minimum rectilinear Steiner trees and related problems (Q2084647) (← links)