Performance analysis of greedy heuristic to find a minimum total-jogs layout for river routing (Q917314): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Optimal Placement for River Routing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: River routing in VLSI / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimal solution to a wire-routing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: River Routing with a Small Number of Jogs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Performance analysis of greedy heuristic to find a minimum total-jogs layout for river routing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3326832 / rank | |||
Normal rank | |||
Latest revision as of 10:01, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Performance analysis of greedy heuristic to find a minimum total-jogs layout for river routing |
scientific article |
Statements
Performance analysis of greedy heuristic to find a minimum total-jogs layout for river routing (English)
0 references
1990
0 references
river routing
0 references
approximation bound
0 references
total jogs minimization
0 references
VLSI layout
0 references
greedy approach
0 references
0 references
