๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem

โœ Scribed by Raymond Greenlaw

Publisher
Springer
Year
1992
Tongue
English
Weight
814 KB
Volume
25
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Tight Bounds for the Maximum Acyclic Sub
Tight Bounds for the Maximum Acyclic Subgraph Problem
โœ Bonnie Berger; Peter W Shor ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 209 KB

Given a directed graph G s V, A , the maximum acyclic subgraph problem is to ลฝ . find a maximum cardinality subset Aะˆ of the arcs such that Gะˆ s V, Aะˆ is acyclic. In this paper, we present polynomial-time and RNC algorithms which, when given ลฝ any graph G without two-cycles, find an acyclic subgraph

A logarithmic approximation algorithm fo
A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem
โœ Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 123 KB

Motivated by the problem of supporting energy-efficient broadcasting in ad hoc wireless networks, we study the Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. We present the first logarithmic approximation algorithm for the problem which uses an interesting reduction to Node-Weighted