𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation algorithms for finding low-degree subgraphs

✍ Scribed by Philip N. Klein; Radha Krishnan; Balaji Raghavachari; R. Ravi

Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
180 KB
Volume
44
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Better Approximation Algorithm for Fin
A Better Approximation Algorithm for Finding Planar Subgraphs
✍ Gruia CΔƒlinescu; Cristina G Fernandes; Ulrich Finkler; Howard Karloff πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 321 KB

The MAXIMUM PLANAR SUBGRAPH problemᎏgiven a graph G, find a largest planar subgraph of Gᎏhas applications in circuit layout, facility layout, and graph drawing. No previous polynomial-time approximation algorithm for this NP-Complete problem was known to achieve a performance ratio larger than 1r3,

A 2-Approximation Algorithm for Finding
A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
✍ Vincenzo Auletta; Yefim Dinitz; Zeev Nutov; Domenico Parente πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 71 KB

The problem of finding a minimum weight k-vertex connected spanning sub-Ε½ . graph in a graph G s V, E is considered. For k G 2, this problem is known to be NP-hard. Combining properties of inclusion-minimal k-vertex connected graphs Ε½ and of k-out-connected graphs i.e., graphs which contain a vertex

A 3-Approximation Algorithm for Finding
A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
✍ Yefim Dinitz; Zeev Nutov πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 103 KB

The problem of finding a minimum weight k-vertex connected spanning sub-Ε½ . graph in a graph G s V, E is considered. For k G 2, this problem is known to be NP-hard. Based on the paper of Auletta, Dinitz, Nutov, and Parente in this issue, Γ„ 4 we derive a 3-approximation algorithm for k g 4, 5 . This

Algorithm for finding one of the largest
Algorithm for finding one of the largest common subgraphs of two three-dimensional graph structures
✍ Sumio Masuda; Hiroyuki Yoshioka; Eiichi Tanaka πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 176 KB πŸ‘ 1 views

Given two connected graphs G a = (V a , E a ) and G b = (V b , E b ) with three-dimensional structures. Let n a = |V a |, m a = |E a |, n b = |V b |, and m b = |E b |. Let the maxi- mum order of a vertex in G a (G b ) be l a (l b ). Initially this paper offers a method to find a largest common subgr