Sökning: "shortest"
Visar resultat 1 - 5 av 154 avhandlingar innehållade ordet shortest.
1. Shortest Path Routing Modelling, Infeasibility and Polyhedra
Sammanfattning : The Internet is constantly growing but the available resources, i.e. bandwidth, are limited. Using bandwidth efficiently to provide high quality of service to users is referred to as traffic engineering. LÄS MER
2. Constraint Programming Methods for Optimization of Single Shortest Path Routing
Sammanfattning : In this thesis, we propose methods based on constraint programming (CP) for solving an optimization problem in telecommunications, the single shortest path routing problem. The problem is to find optimal values for a set of routing configuration parameters in a shortest path routing protocol, for a given network. LÄS MER
3. Exact and approximation algorithms for graph problems with some biological applications
Sammanfattning : In this thesis we study several combinatorial problems in algorithmic graph theory and computational biology, and different algorithmical approaches for solving them. In particular, we focus on graph algorithms, seeking for the most part polynomial or sub-exponential exact solutions, but in some cases also approximate solutions. LÄS MER
4. Dynamic Matrix Algorithms and Applications in Convex and Combinatorial Optimization
Sammanfattning : Dynamic algorithms are used to efficiently maintain solutions to problems where the input undergoes some changes.This thesis studies dynamic algorithms that maintain solutions to linear algebra problems and we explore their applications and implications for dynamic graphs and optimization problems. LÄS MER
5. Inverse Shortest Path Routing Problems in the Design of IP Networks
Sammanfattning : This thesis is concerned with problems related to shortest pathrouting (SPR) in Internet protocol (IP) networks. In IP routing, alldata traffic is routed in accordance with an SPR protocol, e.g. OSPF. LÄS MER