Improved approximation algorithms for embedding hyperedges in a cycle (Q293373): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for routing around a rectangle / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Provably good moat routing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear time algorithm for optimal routing around a rectangle / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A $1.6$ Approximation Algorithm for Routing Multiterminal Nets / rank | |||
Normal rank | |||
Latest revision as of 03:38, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved approximation algorithms for embedding hyperedges in a cycle |
scientific article |
Statements
Improved approximation algorithms for embedding hyperedges in a cycle (English)
0 references
9 June 2016
0 references
approximation algorithms
0 references
parallel computation
0 references
CAD
0 references
linear time algorithms
0 references
minimize congestion
0 references
