Optimization in Geometric Graphs: Complexity and Approximation

Optimization in Geometric Graphs: Complexity and Approximation

We consider several related problems arising in geometric graphs. In particular, we investigate the computational complexity and approximability properties of several optimization problems in unit ball graphs and develop algorithms to find exact and approximate solutions. In addition, we establish c...

Full description

Bibliographic Details
Main Author: Kahruman-Anderoglu, Sera
Other Authors: Butenko, Sergiy
Format: Others
Language:en_US
Published: 2011
Subjects:
graph theory
geometric graphs
heuristics
computational complexity
approximation algorithms
branch and bound
wireless networks
Online Access:http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7092

Internet

http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7092

Similar Items