✦ LIBER ✦

Analysis of Lagrangian Lower Bounds for a Graph Partitioning Problem

✍ Scribed by Gajendra K. Adil and Jay B. Ghosh

Book ID: 123709561
Publisher: INFORMS
Year: 1999
Tongue: English
Weight: 167 KB
Volume: 47
Category: Article
ISSN: 0030-364X
DOI: 10.2307/223102

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A New Lower Bound for the Set-Partitioni

A New Lower Bound for the Set-Partitioning Problem

✍ John, John Welliaveetil 📂 Article 📅 1988 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 995 KB

A lower bound for the steiner tree probl

A lower bound for the steiner tree problem in directed graphs

✍ Weiguo Liu 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 593 KB

A class of bounded approximation algorit

A class of bounded approximation algorithms for graph partitioning

✍ Thomas A. Feo; Mallek Khellaf 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 847 KB

Performance of a genetic algorithm for t

Performance of a genetic algorithm for the graph partitioning problem

✍ Keiko Kohmoto; Kengo Katayama; Hiroyuki Narihisa 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 653 KB

MATHEMATICAL l OWl"lD ." \*ClaNCC d COMPUTER DIRmCT\* MODELLING Mathematical and Computer Modelling 38 (2003)

A lower bound for the circumference of a

A lower bound for the circumference of a graph

✍ Nathan Linial 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 423 KB

Lrzt G = (V, 0 be a ttlock :.>f order n, different from Kn. Let ~FI = min {d(x) + d(y): n then G contains a cycle of length at least m. 1. Introductlion and notatio e discuss only finite undirected graphs withsLc loops and multiple edges. We p:rosye the main theorem d show how Qre's th -orem [ 3.1 o

Lower bounds for the majority communicat

Lower bounds for the majority communication complexity of various graph accessibility problems

✍ C. Meinel, S. Waack 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 532 KB