Approximation algorithm for Minimum Face Spanning Subgraph

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

Автор: Zahidur Rahman

Език:

Корици: С меки корици

Издател: VDM Verlag

Наличност: Налично при издателя, по поръчка

Изпращаме след 17-27 дни

50.87 € 99.50 лв

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

Информация за книгата

Автор

Zahidur Rahman

Език

Английски език

Корици

Книга - С меки корици

Издадена

2009

страници

EAN

9783639212501

ISBN

3639212509

Enbook ID

06829164

Издател

VDM Verlag

Теглоt

Размери

152 x 229 x 3

Пълно описание

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.

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Approximation algorithm for Minimum Face Spanning Subgraph

Информация за книгата

Пълно описание

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също