Pages that link to "Item:Q553340"
From MaRDI portal
The following pages link to Complexity and approximation of the constrained forest problem (Q553340):
Displaying 8 items.
- Finding compact scheme forests in nested normal form is NP-hard (Q1322463) (← links)
- Heuristic approaches for the optimal wiring in large scale robotic skin design (Q1761221) (← links)
- A 3/2-approximation algorithm for some minimum-cost graph problems (Q2340276) (← links)
- A class of heuristics for the constrained forest problem (Q2581555) (← links)
- (Q4406317) (← links)
- (Q4763416) (← links)
- Algorithms and Data Structures (Q5394257) (← links)
- Navigating Forest Straight-Line Programs in Constant Time (Q6485914) (← links)