Degree-Based Spanning Tree Optimization
Title | Degree-Based Spanning Tree Optimization PDF eBook |
Author | Gábor Salamon |
Publisher | LAP Lambert Academic Publishing |
Pages | 120 |
Release | 2012 |
Genre | |
ISBN | 9783659288654 |
We consider several spanning tree optimization problems all having a measure function which depends only on the degrees of the resulting spanning tree. In addition, all investigated problems are generalizations of the Hamiltonian Path problem and so are NP-hard. As we cannot expect exact polynomial-time solutions, we use the approach of approximation algorithms. We look for a suboptimal solution in polynomial time and prove that it is not farther from the optimal one than a given approximation factor. Beside algorithmic aspects, we also consider the number of spanning tree leaves from a bit more theoretical point of view. We investigate how different graph vulnerability parameters, namely scattering number and cut-asymmetry, are related to the number of spanning tree leaves and that of independent spanning tree leaves. Some of our results are applied for the analysis of the Maximum Internal Spanning Tree problem, while some others give connection to the theory of hamiltonicity. In particular, we give a sufficient condition for the existence of a Hamiltonian path by means of cut-asymmetry.
Spanning Trees and Optimization Problems
Title | Spanning Trees and Optimization Problems PDF eBook |
Author | Bang Ye Wu |
Publisher | CRC Press |
Pages | 200 |
Release | 2004-01-27 |
Genre | Computers |
ISBN | 0203497287 |
The design of approximation algorithms for spanning tree problems has become an exciting and important area of theoretical computer science and also plays a significant role in emerging fields such as biological sequence alignments and evolutionary tree construction. While work in this field remains quite active, the time has come to collect under
Optimizing the Degree of Minimum Weight Spanning Trees
Title | Optimizing the Degree of Minimum Weight Spanning Trees PDF eBook |
Author | Cornell University. Dept. of Computer Science |
Publisher | |
Pages | 5 |
Release | 1993 |
Genre | NP-complete problems |
ISBN |
This paper presents two algorithms to construct minimum weight spanning trees with approximately minimum degree. The first method gives a spanning tree whose maximum degree is $O(\delta[superscript]{*} + logn)$ where $\delta[superscript]{*}$ is the minimum possible, and $n$ is the number of vertices. The second method gives a spanning tree of degree no more than $k \cdot (\delta[superscript]{*} + 1)$, where $k$ is the number of distinct weights in the graph. Finding the exact minimum is NP-hard.
Algorithms and Data Structures
Title | Algorithms and Data Structures PDF eBook |
Author | Frank Dehne |
Publisher | Springer |
Pages | 657 |
Release | 2015-07-27 |
Genre | Computers |
ISBN | 3319218409 |
This book constitutes the refereed proceedings of the 14th Algorithms and Data Structures Symposium, WADS 2015, held in Victoria, BC, Canada, August 2015. The 54 revised full papers presented in this volume were carefully reviewed and selected from 148 submissions. The Algorithms and Data Structures Symposium - WADS (formerly Workshop on Algorithms And Data Structures), which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. WADS includes papers presenting original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.
Integer Programming and Combinatorial Optimization
Title | Integer Programming and Combinatorial Optimization PDF eBook |
Author | Jens Vygen |
Publisher | Springer Nature |
Pages | 474 |
Release | |
Genre | |
ISBN | 3031598350 |
Algorithms and Computation
Title | Algorithms and Computation PDF eBook |
Author | Hee-Kap Ahn |
Publisher | Springer |
Pages | 769 |
Release | 2014-11-07 |
Genre | Computers |
ISBN | 3319130757 |
This book constitutes the refereed proceedings of the 25th International Symposium on Algorithms and Computation, ISAAC 2014, held in Jeonju, Korea, in December 2014. The 60 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 171 submissions for inclusion in the book. The focus of the volume in on the following topics: computational geometry, combinatorial optimization, graph algorithms: enumeration, matching and assignment, data structures and algorithms, fixed-parameter tractable algorithms, scheduling algorithms, computational complexity, computational complexity, approximation algorithms, graph theory and algorithms, online and approximation algorithms, and network and scheduling algorithms.
Genetic Algorithms and Engineering Optimization
Title | Genetic Algorithms and Engineering Optimization PDF eBook |
Author | Mitsuo Gen |
Publisher | John Wiley & Sons |
Pages | 520 |
Release | 1999-12-28 |
Genre | Technology & Engineering |
ISBN | 9780471315315 |
Im Mittelpunkt dieses Buches steht eines der wichtigsten Optimierungsverfahren der industriellen Ingenieurtechnik: Mit Hilfe genetischer Algorithmen lassen sich Qualität, Design und Zuverlässigkeit von Produkten entscheidend verbessern. Das Verfahren beruht auf der Wahrscheinlichkeitstheorie und lehnt sich an die Prinzipien der biologischen Vererbung an: Die Eigenschaften des Produkts werden, unter Beachtung der äußeren Randbedingungen, schrittweise optimiert. Ein hochaktueller Band international anerkannter Autoren. (03/00)