Maximum dispersion problem in dense graphs

Andrzej Czygrinow

doi:10.1016/S0167-6377(00)00058-4

Maximum dispersion problem in dense graphs

Andrzej Czygrinow

Mathematical and Statistical Sciences, School of (SoMSS)

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

Abstract

A polynomial-time approximation method for a dense case of dispersion problem in weighted graphs is presented, where weights on edges are integers from {1, ..., K} for some fixed integer K. The algorithm is based on the algorithmic version the regularity lemma.

Original language	English (US)
Pages (from-to)	223-227
Number of pages	5
Journal	Operations Research Letters
Volume	27
Issue number	5
DOIs	https://doi.org/10.1016/S0167-6377(00)00058-4
State	Published - Dec 2000

ASJC Scopus subject areas

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

10.1016/S0167-6377(00)00058-4

Cite this

@article{9b0d18a59b2c43c7b54530f2f2774950,

title = "Maximum dispersion problem in dense graphs",

abstract = "A polynomial-time approximation method for a dense case of dispersion problem in weighted graphs is presented, where weights on edges are integers from {1, ..., K} for some fixed integer K. The algorithm is based on the algorithmic version the regularity lemma.",

author = "Andrzej Czygrinow",

year = "2000",

month = dec,

doi = "10.1016/S0167-6377(00)00058-4",

language = "English (US)",

volume = "27",

pages = "223--227",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "5",

}

TY - JOUR

T1 - Maximum dispersion problem in dense graphs

AU - Czygrinow, Andrzej

PY - 2000/12

Y1 - 2000/12

N2 - A polynomial-time approximation method for a dense case of dispersion problem in weighted graphs is presented, where weights on edges are integers from {1, ..., K} for some fixed integer K. The algorithm is based on the algorithmic version the regularity lemma.

AB - A polynomial-time approximation method for a dense case of dispersion problem in weighted graphs is presented, where weights on edges are integers from {1, ..., K} for some fixed integer K. The algorithm is based on the algorithmic version the regularity lemma.

UR - http://www.scopus.com/inward/record.url?scp=0034504118&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034504118&partnerID=8YFLogxK

U2 - 10.1016/S0167-6377(00)00058-4

DO - 10.1016/S0167-6377(00)00058-4

M3 - Article

AN - SCOPUS:0034504118

SN - 0167-6377

VL - 27

SP - 223

EP - 227

JO - Operations Research Letters

JF - Operations Research Letters

IS - 5

ER -

Maximum dispersion problem in dense graphs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this