Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs: Finding NP Completeness, Efficient Approximation Algorithm and the Ratio
5 Angebote vergleichen
| Preise | 2013 | 2014 | 2015 | 2016 |
|---|---|---|---|---|
| Schnitt | € 48,62 | € 45,65 | € 47,99 | € 53,06 |
| Nachfrage |
1
Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs (2009)
DE PB NWISBN: 9783639196849 bzw. 3639196848, in Deutsch, VDM, Taschenbuch, neu.
Lieferung aus: Schweiz, Versandfertig innert 6 - 9 Tagen.
Finding NP Completeness, Efficient Approximation Algorithm and the Ratio, This Book deals with the NP-Completeness and an approximation algorithm for finding minimum edge ranking spanning tree (MERST) on series-parallel graphs. An edge-ranking is optimal if the least number of distinct labels among all possible edge-rankings are used by it. The edge-ranking problem is to find an optimal edge-ranking of a given graph. The minimum edge-ranking spanning tree problem is to find a spanning tree of a graph G whose edge-ranking is minimum. The minimum edge-ranking spanning tree problem of graphs has important applications like scheduling the parallel assembly of a complex multi-part product from its components and relational database. Although polynomial-time algorithm to solve the minimum edge-ranking spanning tree problem on series- parallel graphs with bounded degrees has been found, but for the unbounded degrees no polynomial-time algorithm is known. In this work, we have proved that the minimum edge-ranking spanning tree problem for general series-parallel graph is NP-Complete and designed an efficient approximation algorithm which will find a near-optimal solution of the problem. Taschenbuch, 01.09.2009.
Finding NP Completeness, Efficient Approximation Algorithm and the Ratio, This Book deals with the NP-Completeness and an approximation algorithm for finding minimum edge ranking spanning tree (MERST) on series-parallel graphs. An edge-ranking is optimal if the least number of distinct labels among all possible edge-rankings are used by it. The edge-ranking problem is to find an optimal edge-ranking of a given graph. The minimum edge-ranking spanning tree problem is to find a spanning tree of a graph G whose edge-ranking is minimum. The minimum edge-ranking spanning tree problem of graphs has important applications like scheduling the parallel assembly of a complex multi-part product from its components and relational database. Although polynomial-time algorithm to solve the minimum edge-ranking spanning tree problem on series- parallel graphs with bounded degrees has been found, but for the unbounded degrees no polynomial-time algorithm is known. In this work, we have proved that the minimum edge-ranking spanning tree problem for general series-parallel graph is NP-Complete and designed an efficient approximation algorithm which will find a near-optimal solution of the problem. Taschenbuch, 01.09.2009.
2
Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs: Finding NP Completeness, Efficient Approximation Algorithm and the Ratio (2009)
EN PB USISBN: 9783639196849 bzw. 3639196848, in Englisch, 72 Seiten, VDM Verlag, Taschenbuch, gebraucht.
Fra: $50.97 (11 Tilbud)
Brukt fra: $72.45 (2 Tilbud)
Vis mer 13 Tilbud på Amazon.com
Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 1-2 business days.
Von Händler/Antiquariat, The German Book Store.
This Book deals with the NP-Completeness and an approximation algorithm for finding minimum edge ranking spanning tree (MERST) on series-parallel graphs. An edge-ranking is optimal if the least number of distinct labels among all possible edge-rankings are used by it. The edge-ranking problem is to find an optimal edge-ranking of a given graph. The minimum edge-ranking spanning tree problem is to find a spanning tree of a graph G whose edge-ranking is minimum. The minimum edge-ranking spanning tree problem of graphs has important applications like scheduling the parallel assembly of a complex multi-part product from its components and relational database. Although polynomial-time algorithm to solve the minimum edge-ranking spanning tree problem on series- parallel graphs with bounded degrees has been found, but for the unbounded degrees no polynomial-time algorithm is known. In this work, we have proved that the minimum edge-ranking spanning tree problem for general series-parallel graph is NP-Complete and designed an efficient approximation algorithm which will find a near-optimal solution of the problem. Paperback, Etikett: VDM Verlag, VDM Verlag, Varegrupper: Book, Publisert: 2009-09-11, Studio: VDM Verlag.
Von Händler/Antiquariat, The German Book Store.
This Book deals with the NP-Completeness and an approximation algorithm for finding minimum edge ranking spanning tree (MERST) on series-parallel graphs. An edge-ranking is optimal if the least number of distinct labels among all possible edge-rankings are used by it. The edge-ranking problem is to find an optimal edge-ranking of a given graph. The minimum edge-ranking spanning tree problem is to find a spanning tree of a graph G whose edge-ranking is minimum. The minimum edge-ranking spanning tree problem of graphs has important applications like scheduling the parallel assembly of a complex multi-part product from its components and relational database. Although polynomial-time algorithm to solve the minimum edge-ranking spanning tree problem on series- parallel graphs with bounded degrees has been found, but for the unbounded degrees no polynomial-time algorithm is known. In this work, we have proved that the minimum edge-ranking spanning tree problem for general series-parallel graph is NP-Complete and designed an efficient approximation algorithm which will find a near-optimal solution of the problem. Paperback, Etikett: VDM Verlag, VDM Verlag, Varegrupper: Book, Publisert: 2009-09-11, Studio: VDM Verlag.
3
Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs
EN NWISBN: 9783639196849 bzw. 3639196848, in Englisch, VDM Verlag Dr. Müller, Saarbrücken, Deutschland, neu.
Lieferung aus: Deutschland, zzgl. Versandkosten, Sofort lieferbar.
Finding NP Completeness, Efficient Approximation Algorithm and the Ratio, This Book deals with the NP-Completeness and an approximation algorithm for finding minimum edge ranking spanning tree (MERST) on series-parallel graphs. An edge-ranking is optimal if the least number of distinct labels among all possible edge-rankings are used by it. The edge-ranking problem is to find an optimal edge-ranking of a given graph. The minimum edge-ranking spanning tree problem is to find a spanning tree of a graph G whose edge-ranking is minimum. The minimum edge-ranking spanning tree problem of graphs has important applications like scheduling the parallel assembly of a complex multi-part product from its components and relational database. Although polynomial-time algorithm to solve the minimum edge-ranking spanning tree problem on series- parallel graphs with bounded degrees has been found, but for the unbounded degrees no polynomial-time algorithm is known. In this work, we have proved that the minimum edge-ranking spanning tree problem for general series-parallel graph is NP-Complete and designed an efficient approximation algorithm which will find a near-optimal solution of the problem.
Finding NP Completeness, Efficient Approximation Algorithm and the Ratio, This Book deals with the NP-Completeness and an approximation algorithm for finding minimum edge ranking spanning tree (MERST) on series-parallel graphs. An edge-ranking is optimal if the least number of distinct labels among all possible edge-rankings are used by it. The edge-ranking problem is to find an optimal edge-ranking of a given graph. The minimum edge-ranking spanning tree problem is to find a spanning tree of a graph G whose edge-ranking is minimum. The minimum edge-ranking spanning tree problem of graphs has important applications like scheduling the parallel assembly of a complex multi-part product from its components and relational database. Although polynomial-time algorithm to solve the minimum edge-ranking spanning tree problem on series- parallel graphs with bounded degrees has been found, but for the unbounded degrees no polynomial-time algorithm is known. In this work, we have proved that the minimum edge-ranking spanning tree problem for general series-parallel graph is NP-Complete and designed an efficient approximation algorithm which will find a near-optimal solution of the problem.
4
Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs: Finding NP Completeness, Efficient Approximation Algorithm and the Ratio (2009)
EN PB NWISBN: 9783639196849 bzw. 3639196848, in Englisch, 72 Seiten, VDM Verlag, Taschenbuch, neu.
Fra: EUR 43,51 (35 Tilbud)
Vis mer 35 Tilbud på Amazon.de (Int.)
Lieferung aus: Deutschland, Versandfertig in 1 - 2 Werktagen.
Von Händler/Antiquariat, dodax-shop-eu.
Taschenbuch, Etikett: VDM Verlag, VDM Verlag, Varegrupper: Book, Publisert: 2009-09-11, Studio: VDM Verlag.
Von Händler/Antiquariat, dodax-shop-eu.
Taschenbuch, Etikett: VDM Verlag, VDM Verlag, Varegrupper: Book, Publisert: 2009-09-11, Studio: VDM Verlag.
5
Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs
DE NWISBN: 9783639196849 bzw. 3639196848, in Deutsch, VDM Verlag Dr. Müller, Saarbrücken, Deutschland, neu.
Lieferung aus: Deutschland, zzgl. Versandkosten, 3639196848.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Lade…