Approximation algorithm for Minimum Face Spanning Subgraph

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

Autor: Zahidur Rahman

Limbă:

Legare: Carte broșată

Editura: VDM Verlag

Disponibilitate: La editor doar la comandă

Expediem în 17-27 zile

254.96 lei

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

Informații despre carte

Autor

Zahidur Rahman

Limbă

engleză

Legare

Carte - Carte broșată

Publicat

2009

Pagini

EAN

9783639212501

ISBN

3639212509

Enbook ID

06829164

Editura

VDM Verlag

Greutate

Dimensiuni

152 x 229 x 3

Descriere completă

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.

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Approximation algorithm for Minimum Face Spanning Subgraph

Informații despre carte

Descriere completă

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și