๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Sums of Cuts and Bipartite Metrics

โœ Scribed by Karzanov, A.V.

Book ID
122925542
Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
778 KB
Volume
11
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Metrics and undirected cuts
Metrics and undirected cuts
โœ A. V. Karzanov ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 844 KB
Geometry of Cuts and Metrics
Geometry of Cuts and Metrics
โœ Michel Marie Deza, Monique Laurent (auth.) ๐Ÿ“‚ Library ๐Ÿ“… 1997 ๐Ÿ› Springer ๐ŸŒ English โš– 2 MB

Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinating connections - in diverse fields: in graph theory, combinatorial optimization, geometry of numbers, distance geometry, combinatorial matrix theory, statistical physics, VLSI design etc. A main featu

Minimum Color Sum of Bipartite Graphs
Minimum Color Sum of Bipartite Graphs
โœ Amotz Bar-Noy; Guy Kortsarz ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 242 KB

The problem of minimum color sum of a graph is to color the vertices of the ลฝ . graph such that the sum average of all assigned colors is minimum. Recently it was shown that in general graphs this problem cannot be approximated within 1y โ‘€ ลฝ n , for any โ‘€ ) 0, unless NP s ZPP Bar-Noy et al., Informa