𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A cubic algorithm for the directed Eulerian subgraph problem

✍ Scribed by M.B. Richey; R.Gary Parker

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
486 KB
Volume
50
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

An ILP formulation and genetic algorithm
An ILP formulation and genetic algorithm for the Maximum Degree-Bounded Connected Subgraph problem
✍ Milena BogdanoviΔ‡ πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 344 KB

A general instance of a Degree-Constrained Subgraph problem may be found in an edgeweighted or vertex-weighted graph G whereas the objective is to find an optimal weighted subgraph, subject to certain degree constraints on the vertices of the subgraph. This class of combinatorial problems has been e