Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD point 990 Ft DPD courier 1 190 Ft GLS point 1 190 Ft Hungarian Post 1 795 Ft Hungarian Post 1 690 Ft Hungarian Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft GLS courier 1 690 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Approximation algorithm for Minimum Face Spanning Subgraph

Name: Approximation algorithm for Minimum Face Spanning Subgraph
Brand: VDM Verlag
SKU: 06829164
Price: 18080 HUF
Availability: InStock
Author: Zahidur Rahman
ISBN: 9783639212501

Zahidur Rahman

Language

English

Book Paperback

Libristo code: 06829164

Publishers VDM Verlag, November 2009

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

Libristo code: 06829164

121 b

18 080 Ft

Print on demand Shipping in 17-27 days

Up to 30 days for returns

Customers also purchased

Le petit livre de l'Ikigaï Ken Mogi

Paperback

7 768 Ft

Konzept der praktischen Bakteriologie Ameer Khusro

Paperback

23 196 Ft

Švadlenin dar Fiona Valpy

Hardback

4 597 Ft

Biblische Erzählungen des Alten Testamentes J. G. Schaal

Paperback

6 164 Ft

scelta di Budgie. Nessun ritorno è impossibile J. Dana Trent

Paperback

11 029 Ft

Les graines germées - Sources de vie et de santé

Paperback

4 833 Ft

Človek a jeho jazyk 4 Jana Levická; Miroslav Zumrík

Paperback

4 488 Ft

La mujer de la Contaduría en cargos de liderazgo y toma de decisiones Sandra Milena Forero Sierra

Paperback

12 917 Ft

Die dynamoelektrische Maschine Oscar Frölich

Paperback

19 217 Ft

Le Voyage d'Outremer de Bertrandon de la Broquiere, (Ed.1892) Bertrandon De La Broquiere

Paperback

10 147 Ft

En Bernat detectiu i l'anell del templer de Capdella Josefina Llauradó Senar

Paperback

4 356 Ft

Comunicología de la liberación, desarrollismo y políticas públicas Luis Ramiro Beltrán Salmón

Paperback

8 155 Ft

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.