Algorithms and Data Structures
From MaRDI portal
Publication:5900777
DOI10.1007/b11837zbMath1278.68109MaRDI QIDQ5900777
Elena Prieto, Christian Sloper
Publication date: 20 April 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem, Improved upper bounds for vertex cover, Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree, The complexity ecology of parameters: An illustration using bounded max leaf number, A parameterized perspective on packing paths of length two, Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem, Minimum leaf out-branching and related problems, Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}, Crown reductions for the minimum weighted vertex cover problem, Unnamed Item, Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems, Improved Approximations for Hard Optimization Problems via Problem Instance Classification, Structural Properties of Hard Metric TSP Inputs, Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem, A 2k-vertex Kernel for Maximum Internal Spanning Tree
