✦ LIBER ✦

Improved Approximations for Weighted and Unweighted Graph Problems

✍ Scribed by Marc Demange; Vangelis Paschos

Publisher: Springer
Year: 2004
Tongue: English
Weight: 322 KB
Volume: 38
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-004-1162-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved Approximation Algorithms for Ma

Improved Approximation Algorithms for Maximum Graph Partitioning Problems

✍ Gerold Jäger; Anand Srivastav 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 289 KB

A survey on the linear ordering problem

A survey on the linear ordering problem for weighted or unweighted tournaments

✍ Irène Charon; Olivier Hudry 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 803 KB

Improved Bandwidth Approximation for Tre

Improved Bandwidth Approximation for Trees and Chordal Graphs

✍ Anupam Gupta 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 110 KB

A linear arrangement of an n-vertex graph G = V E is a one-one mapping f of the vertex set V onto the set n = 0 1 n -1 . The bandwidth of this linear arrangement is the maximum difference between the images of the endpoints of any edge in E G . When the input graph G is a tree, the best known approx

A coloring problem for weighted graphs

✍ D.J. Guan; Zhu Xuding 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 515 KB

NOTE Improved Approximation Algorithms f

NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems

✍ Michal Penn; Haya Shasha-Krupnik 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 126 KB

The problem of finding a minimum augmenting edge-set to make a graph k-vertex connected is considered. This problem is denoted as the minimum k-augmentation problem. For weighted graphs, the minimum k-augmentation problem is NP-complete. Our main result is an approximation algorithm with a performan

Turán problems for integer-weighted grap

Turán problems for integer-weighted graphs

✍ Zoltán Füredi; André Kündgen 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 238 KB

## Abstract A multigraph is (__k__,__r__)‐dense if every __k__‐set spans at most __r__ edges. What is the maximum number of edges ex~ℕ~(__n__,__k__,__r__) in a (__k__,__r__)‐dense multigraph on __n__ vertices? We determine the maximum possible weight of such graphs for almost all __k__ and __r__ (e