The following pages link to Andrew B. Kahng (Q703268):
Displayed 19 items.
- Match twice and stitch: a new TSP tour construction heuristic. (Q703270) (← links)
- Spectral partitioning with multiple eigenvectors (Q1276952) (← links)
- Best-so-far vs. where-you-are: Implications for optimal finite-time annealing (Q1319482) (← links)
- A new adaptive multi-start technique for combinatorial global optimizations (Q1342281) (← links)
- Splitting an ordering into a partition to minimize diameter (Q1367012) (← links)
- Asymmetric binary covering codes. (Q1865393) (← links)
- Improved large-step Markov chain variants for the symmetric TSP (Q2567843) (← links)
- (Q3024759) (← links)
- Recent directions in netlist partitioning: a survey (Q3122465) (← links)
- VLSI Physical Design: From Graph Partitioning to Timing Closure (Q3577051) (← links)
- (Q4410160) (← links)
- (Q4471869) (← links)
- (Q4540076) (← links)
- Efficient optimization by modifying the objective function: applications to timing-driven VLSI layout (Q4540170) (← links)
- (Q4764186) (← links)
- (Q4778566) (← links)
- Zero skew clock routing with minimum wirelength (Q5285771) (← links)
- Design and implementation of move-based heuristics for VLSI hypergraph partitioning (Q5463400) (← links)
- VLSI Physical Design: From Graph Partitioning to Timing Closure (Q6060787) (← links)