𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability

✍ Scribed by Daya Ram Gaur; Ramesh Krishnamurti

Book ID
110301677
Publisher
Springer US
Year
2001
Tongue
English
Weight
42 KB
Volume
5
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Improved bounds and algorithms for hyper
Improved bounds and algorithms for hypergraph 2-coloring
✍ Jaikumar Radhakrishnan; Aravind Srinivasan πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 259 KB πŸ‘ 2 views

We show that for all large n, every n-uniform hypergraph with at most 0 7 n/ ln n Γ— 2 n edges can be 2-colored. This makes progress on a problem of ErdΕ‘s [Nordisk Mat. Tidskrift 11, 5-10 (1963)], improving the previous-best bound of n 1/3-o 1 Γ— 2 n due to Beck [Discrete Math. 24, 127-137 (1978)]. We

A Static 2-Approximation Algorithm for V
A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity
✍ Monika Rauch Henzinger πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 329 KB

This paper presents insertions-only algorithms for maintaining the exact andror approximate size of the minimum edge cut and the minimum vertex cut of a graph. Ε½ . The algorithms output the approximate or exact size k in time O 1 and a cut of size k in time linear in its size. For the minimum edge