Contacto
Cómo comprar
Entrega
Guía de compras
Approximation algorithm for Minimum Face Spanning Subgraph
Inglés
130 b
Política de devolución de 30 días
Clientes que también han comprado
/
Tapa blanda
39.39
€
/
Tapa blanda
30.19
€
/
Tapa blanda
23.89
€
One of the newest problem in the eld of planar graphs is to nd a connected subgraph of a plane graph such that all the faces of that plane graph are covered. The faces of a plane graph are the maximal regions of the plane that contain no point used in the embedding. A face is said to be covered or spanned if at least one of the vertices of that face boundary is visited. We denote this type of subgraph as a face spanning subgraph. The minimum face spanning subgraph is the face spanning subgraph with minimum cost. Cost can be measured by number vertices or total weight of the edges. These kind of problems have practical applications in the areas like planning gas pipelines in a locality, layout of power supply lines in a printed circuit board, planning irrigation canal networks in irrigation system etc. The problem mentioned above has already been proved as an NP-complete problem and a linear time approximation algorithm has also been proposed. In this thesis we will present some cases where that algorithm fails. Then we try to devise another approximation algorithm with better approximation ratio.
Sobre el libro
Inglés
Regale este libro hoy
Es fácil
1 Añadir al carrito y elegir Entregar como regalo en el checkout 2 Le enviaremos un vale 3 El libro llegará a la dirección del destinatarioTambién puede interesarle
/
Tapa blanda
29.49
€
