Efficient computation of tolerances in the weighted independent set problem for trees
type: Item
instance of: scholarly article
title: Efficient computation of tolerances in the weighted independent set problem for trees
zbMATH Open document ID: 1275.68111
DOI: 10.1134/S1064562413030186
author: Panos M. Pardalos
author: Boris Goldengorin
author: D. S. Malyshev
published in: Doklady Mathematics
publication date: 2013-11-11T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6225239
zbMATH Keywords: dynamic progamming
zbMATH Keywords: weighted independent set problem
MaRDI profile type: Publication
cites work: An Algorithm for the Three-Index Assignment Problem
cites work: Experimental and Efficient Algorithms
cites work: An optimal time algorithm for finding a maximum weight independent set in a tree
cites work: Lower tolerance-based branch and bound algorithms for the ATSP
cites work: Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
cites work: Arc tolerances in shortest path and network flow problems
cites work: Tolerance-based branch and bound algorithms for the ATSP
cites work: An addendum on: ``Sensitivity analysis of the optimal assignment''
full work available at URL: s1064562413030186
OpenAlex ID: W2095545793
Recommended article: Efficient computation of tolerances in the weighted independent set problem for some classes of graphs
Recommended article: A tolerance-based heuristic approach for the weighted independent set problem
Recommended article: An optimal time algorithm for finding a maximum weight independent set in a tree
Recommended article: Graph-Theoretic Concepts in Computer Science
Recommended article: Q3798257
Recommended article: Q4511244
Recommended article: Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
Recommended article: Approximation algorithms for the weighted independent set problem in sparse graphs
Recommended article: Exact algorithms and applications for tree-like Weighted Set Cover
Recommended article: Finding Totally Independent Spanning Trees with Linear Integer Programming
description: scientific article; zbMATH DE number 6225239