Routing non-convex grids without holes.
Dee ParksMiroslaw TruszczynskiPublished in: Great Lakes Symposium on VLSI (1991)
Keyphrases
- routing algorithm
- routing protocol
- ad hoc networks
- routing problem
- convex hull
- convex optimization
- grid computing
- convex sets
- network topology
- shortest path
- dynamic routing
- wireless ad hoc networks
- piecewise linear
- globally optimal
- end to end
- convex relaxation
- wireless networks
- social networks
- convex constraints
- ant algorithm
- strictly convex
- hexagonal grid
- biological inspired
- convexity properties
- semi infinite programming