On a max-min problem concerning weights of edges

被引：9

作者：

Jendrol, S ^{[1
]}

Schiermeyer, I

机构：

[1] Safarik Univ, Dept Geometr & Algebra, Kosice 04154, Slovakia

[2] Tech Univ, Bergakad Freiberg, Fak Math & Informat, D-09596 Freiburg, Germany

来源：

COMBINATORICA | 2001年 / 21卷 / 03期

关键词：

D O I：

10.1007/s004930100001

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The weight omega (e) of an edge e = uv of a graph is defined to be the sum of degrees of the vertices u and v. In 1990 P. Erdos asked the question: What is the minimum weight of an edge of a graph G having n vertices and m, edges? This paper brings a precise answer to the above question of Erdos.

引用

页码：351 / 359

页数：9

共 50 条

[1] On a Max-min Problem Concerning Weights of Edges
Stanislav Jendrol'
Ingo Schiermeyer
[J]. Combinatorica, 2001, 21 : 351 - 359
[2] A MAX-MIN PROBLEM
MARSH, DCB
[J]. AMERICAN MATHEMATICAL MONTHLY, 1967, 74 (1P1): : 86 - &
[3] NONCONVEX MAX-MIN PROBLEM
FALK, JE
HOFFMAN, K
[J]. NAVAL RESEARCH LOGISTICS, 1977, 24 (03) : 441 - 450
[4] A GEOMETRIC MAX-MIN PROBLEM
WYLER, O
[J]. AMERICAN MATHEMATICAL MONTHLY, 1968, 75 (07): : 781 - &
[5] DISCRETE MAX-MIN PROBLEM
RANDOLPH, PH
SWINSON, GE
[J]. NAVAL RESEARCH LOGISTICS QUARTERLY, 1969, 16 (03): : 309 - &
[6] LINEAR FRACTIONAL MAX-MIN PROBLEM
COOK, WD
KIRBY, MJL
MEHNDIRATTA, SL
[J]. OPERATIONS RESEARCH, 1975, 23 (03) : 511 - 521
[7] AN OLD MAX-MIN PROBLEM REVISITED
EMBRYWARDROP, M
[J]. AMERICAN MATHEMATICAL MONTHLY, 1990, 97 (05): : 421 - 423
[8] Max-min sum minimization transportation problem
Puri, S
Puri, MC
[J]. ANNALS OF OPERATIONS RESEARCH, 2006, 143 (01) : 265 - 275
[9] Approximation algorithms for the max-min allocation problem
Khot, Subhash
Ponnuswami, Ashok Kumar
[J]. APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2007, 4627 : 204 - +
[10] Max-min sum minimization transportation problem
Sonia Puri
M. C. Puri
[J]. Annals of Operations Research, 2006, 145 (1) : 385 - 385

← 1 2 3 4 5 →