Multiterminal global routing: A deterministic approximation scheme (Q916369): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: ``Integer-making'' theorems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new polynomial-time algorithm for linear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An \(O(IVI^3)\) algorithm for finding maximum flows in networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Balancing families of sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probabilistic construction of deterministic algorithms: approximating packing integer programs / rank | |||
Normal rank |
Latest revision as of 09:50, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Multiterminal global routing: A deterministic approximation scheme |
scientific article |
Statements
Multiterminal global routing: A deterministic approximation scheme (English)
0 references
1991
0 references
global routing
0 references
approximation algorithm
0 references