Approximation algorithm for Minimum Face Spanning Subgraph

Name: Approximation algorithm for Minimum Face Spanning Subgraph
Brand: VDM Verlag
SKU: 9783639212501
Price: 48.52 EUR
Availability: InStock

Autor: Zahidur Rahman

Jazyk:

Väzba: Brožovaná

Vydavateľ: VDM Verlag

Dostupnosť: U vydavateľa na objednávku

Odosielame za 17-27 dní

48.52 €

One of the newest problem in the eld of planar graphs is to nd a connected subgraph of a plane gra...

Informácie o knihe

Autor

Zahidur Rahman

Jazyk

Angličtina

Väzba

Kniha - Brožovaná

Vydalo

2009

Stránok

EAN

9783639212501

ISBN

3639212509

Enbook ID

06829164

Vydavateľ

VDM Verlag

Hmotnosť

Rozmery

152 x 229 x 3

Kompletný popis

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.

Mohlo by vás zaujímať

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež

Najčastejšie vyhľadávané

Categories

Authors

Publishers

Produkty

Produkty

Najčastejšie vyhľadávané

Categories

Authors

Publishers

Produkty

Produkty

Approximation algorithm for Minimum Face Spanning Subgraph

Informácie o knihe

Kompletný popis

Mohlo by vás zaujímať

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež