Approximation algorithms for multi-parameter graph optimization problems

Ivan Basov; Alek Vainshtein

doi:10.1016/S0166-218X(01)00269-4

Approximation algorithms for multi-parameter graph optimization problems

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

Abstract

Given a graph with k>2 different nonnegative weights associated with each edge e and a cost function c: R^k→R₊, consider the problem of finding a minimum-cost edge subset possessing a certain property P. We prove that this problem is weakly NP-hard for a wide class of properties P and costs c, including paths, spanning trees, cuts, joins, etc. We suggest a simple approximation algorithm for this problem and find its performance guarantee.

Original language	English
Pages (from-to)	129-138
Number of pages	10
Journal	Discrete Applied Mathematics
Volume	119
Issue number	1-2
DOIs	https://doi.org/10.1016/S0166-218X(01)00269-4
State	Published - 2002

Keywords

Approximation algorithms
Graph algorithms
Multi-parameter problems
Performance guarantee

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/S0166-218X(01)00269-4

Cite this

@article{fb00e07db07144df9ec327acc14823b2,

title = "Approximation algorithms for multi-parameter graph optimization problems",

abstract = "Given a graph with k>2 different nonnegative weights associated with each edge e and a cost function c: Rk→R+, consider the problem of finding a minimum-cost edge subset possessing a certain property P. We prove that this problem is weakly NP-hard for a wide class of properties P and costs c, including paths, spanning trees, cuts, joins, etc. We suggest a simple approximation algorithm for this problem and find its performance guarantee.",

keywords = "Approximation algorithms, Graph algorithms, Multi-parameter problems, Performance guarantee",

author = "Ivan Basov and Alek Vainshtein",

year = "2002",

doi = "10.1016/S0166-218X(01)00269-4",

language = "English",

volume = "119",

pages = "129--138",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

number = "1-2",

}

TY - JOUR

T1 - Approximation algorithms for multi-parameter graph optimization problems

AU - Basov, Ivan

AU - Vainshtein, Alek

PY - 2002

Y1 - 2002

N2 - Given a graph with k>2 different nonnegative weights associated with each edge e and a cost function c: Rk→R+, consider the problem of finding a minimum-cost edge subset possessing a certain property P. We prove that this problem is weakly NP-hard for a wide class of properties P and costs c, including paths, spanning trees, cuts, joins, etc. We suggest a simple approximation algorithm for this problem and find its performance guarantee.

AB - Given a graph with k>2 different nonnegative weights associated with each edge e and a cost function c: Rk→R+, consider the problem of finding a minimum-cost edge subset possessing a certain property P. We prove that this problem is weakly NP-hard for a wide class of properties P and costs c, including paths, spanning trees, cuts, joins, etc. We suggest a simple approximation algorithm for this problem and find its performance guarantee.

KW - Approximation algorithms

KW - Graph algorithms

KW - Multi-parameter problems

KW - Performance guarantee

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

U2 - 10.1016/S0166-218X(01)00269-4

DO - 10.1016/S0166-218X(01)00269-4

M3 - Article

AN - SCOPUS:84867948420

SN - 0166-218X

VL - 119

SP - 129

EP - 138

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 1-2

ER -

Approximation algorithms for multi-parameter graph optimization problems

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this