منابع مشابه
The maximum f-depth spanning tree problem
This paper deals with the problem of constructing directed trees of optimal weight and root r with depth at most f(|V |) (called f − depthDSTPr). We first prove that the maximization and the minimization versions are equal-approximable under the differential ratio, that measures how the value of an approximate solution is placed in the interval between the worst and the best solutions values of...
متن کاملMaximum Bounded Rooted-Tree Packing Problem
Given a graph and a root, the Maximum Bounded Rooted-Tree Packing (MBRTP) problem aims at finding K rooted-trees that span the largest subset of vertices, when each vertex has a limited outdegree. This problem is motivated by peerto-peer streaming overlays in under-provisioned systems. We prove that the MBRTP problem is NP-complete. We present two polynomial-time algorithms that computes an opt...
متن کاملPhonetic speaker recognition using maximum-likelihood binary-decision tree models
Recent work in phonetic speaker recognition has shown that modeling phone sequences using n-grams is a viable and effective approach to speaker recognition, primarily aiming at capturing speaker-dependent pronunciation and also word usage. This paper describes a method involving binary-tree-structured statistical models for extending the phonetic context beyond that of standard n-grams (particu...
متن کاملApproximation Algorithms for the Maximum Weight Internal Spanning Tree Problem
Given a vertex-weighted connected graphG = (V,E), the maximum weight internal spanning tree (MwIST for short) problem asks for a spanning tree T of G such that the total weight of the internal vertices in T is maximized. The unweighted variant, denoted as MIST, is NPhard and APX-hard, and the currently best approximation algorithm has a proven performance ratio 13/17. The currently best approxi...
متن کاملAn Exact Algorithm for the Maximum Leaf Spanning Tree Problem
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leaves k, this problem can be solved in time O(4poly(n)) using a simple branching algorithm introduced by a subset of the authors [12]. Daligault, Gutin, Kim, and Yeo [6] improved the branching and obtained a running time ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2021
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-021-00836-5