Pages that link to "Item:Q1097238"
From MaRDI portal
The following pages link to Global wire routing in two-dimensional arrays (Q1097238):
Displaying 16 items.
- Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
- Complexity of pairwise shortest path routing in the grid (Q703544) (← links)
- Matrix approximation and Tusnády's problem (Q872057) (← links)
- Global wire routing in two-dimensional arrays (Q1097238) (← links)
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs (Q1106724) (← links)
- Probabilistic construction of deterministic algorithms: approximating packing integer programs (Q1112724) (← links)
- Integer programming in VLSI design (Q1201818) (← links)
- The pin redistribution problem in multi-chip modules (Q1327562) (← links)
- Algorithms for hierarchical and semi-partitioned parallel scheduling (Q2037194) (← links)
- ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors (Q2281614) (← links)
- Minimizing maximum fiber requirement in optical networks (Q2581759) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- Approximation-Friendly Discrepancy Rounding (Q3186517) (← links)
- Kernelization of Two Path Searching Problems on Split Graphs (Q4632190) (← links)
- A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks (Q5357510) (← links)
- (Q5743405) (← links)
