Algorithms and Optimization Gabriel Robins

1
Algorithms andOptimization Gabriel Robins
CS Corporate Partners Annual MeetingNovember 9,
2001 Department of Computer ScienceUniversity
of Virginiawww.cs.virginia.edu
2
Perfection in design is achieved not when
theres nothing to left to add, but when theres
nothing left to remove.
3
Make everything as simple as possible, but not
simpler. - Albert Einstein (1879-1955)
4
Algorithms
Solution
exact
approximate
Speed
fast
Short sweet
Quick dirty
slow
Slowly but surely
Too little, too late
5
Complexity
6
VLSI Design
Physical Layout
7
Trends in Interconnect
time
8
Placement
Routing
9
Steiner Trees
10
Steiner Trees
Steiner Trees
11
Bounded Radius Trees

• Algorithm
• Input
• points / graph
• any e gt 0
• Output tree T with
• radius(T) (1e) OPT
• cost(T) (12/e) OPT

12
You want proof? Ill give you proof!
13
Circuit Testing
14
Improving Manufacturability
15
Moving-Target TSP
16
Moving-Target TSP
Theorem waiting can never help Algorithms
efficient exact solution for 1-dimension
efficient heuristics for other variants
17
Robust Paths
18
Minimum Surfaces
19
Evolutionary Trees
20
Evolutionary Trees
21
Discovering New Proteins
22
Landmine Detection
23
Lets Collaborate!

• What we offer
• Brainpower ideas
• Skills and experience
• UVas infrastructure
• Faculty students employees
• What we need
• Practical problems to solve
• Some support

24
UVa Computer Science
25
I think you should be more explicit here
in step two.