ISBN: 9783639212501

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. Bücher, Hörbücher & Kalender / Bücher / Sachbuch / Computer & IT, [PU: VDM Verlag Dr. Müller, Saarbrücken]

Dodax.de Nr. IV235DNGLFR. Shipping costs:, Lieferzeit: 5 Tage, DE. (EUR 0.00) Details... |

2009, ISBN: 9783639212501

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. Buch (fremdspr.) Md. Zahidur Rahman Taschenbuch, VDM, 01.11.2009, VDM, 2009

Orellfuessli.ch Nr. 18669358. Shipping costs:, Versandfertig innert 3 - 5 Werktagen, zzgl. Versandkosten. (EUR 16.73) Details... |

2009, ISBN: 9783639212501

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. Buch (fremdspr.) Md. Zahidur Rahman Taschenbuch, VDM, 01.11.2009, VDM, 2009

Orellfuessli.ch Nr. 18669358. Shipping costs:, Versandfertig innert 4 - 7 Werktagen, zzgl. Versandkosten. (EUR 17.07) Details... |

Approximation algorithm for Minimum Face Spanning Subgraph A solution to Minimize Cost for the real time Distribution, Layout

*- new book*

2009, ISBN: 3639212509

Kartoniert / Broschiert, mit Schutzumschlag neu, [PU:VDM Verlag]

Achtung-Buecher.de MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien Shipping costs:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Details... |

Approximation algorithm for Minimum Face Spanning Subgraph A solution to Minimize Cost for the real time Distribution, Layout

*- new book*

2009, ISBN: 3639212509

Kartoniert / Broschiert, met couverture neu, [PU:VDM Verlag]

Achtung-Buecher.de MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien Shipping costs:Geen versendingskosten in Duitsland. (EUR 0.00) Details... |

ISBN: 9783639212501

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 … More...

2009, ISBN: 9783639212501

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 ar… More...

2009

## ISBN: 9783639212501

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 ar… More...

Approximation algorithm for Minimum Face Spanning Subgraph A solution to Minimize Cost for the real time Distribution, Layout

*- new book*

2009, ISBN: 3639212509

Kartoniert / Broschiert, mit Schutzumschlag neu, [PU:VDM Verlag]

Approximation algorithm for Minimum Face Spanning Subgraph A solution to Minimize Cost for the real time Distribution, Layout

*- new book*

2009, ISBN: 3639212509

Kartoniert / Broschiert, met couverture neu, [PU:VDM Verlag]

Author: | |

Title: | |

ISBN: |

** Details of the book - Approximation Algorithm For Minimum Face Spanning Subgraph**

EAN (ISBN-13): 9783639212501

ISBN (ISBN-10): 3639212509

Hardcover

Paperback

Publishing year: 2009

Publisher: VDM Verlag

52 Pages

Weight: 0,094 kg

Language: eng/Englisch

Book in our database since 2009-06-04T08:26:44+01:00 (London)

Detail page last modified on 2020-09-22T17:42:45+01:00 (London)

ISBN/EAN: 9783639212501

ISBN - alternate spelling:

3-639-21250-9, 978-3-639-21250-1

< to archive...