Min-max cover of a graph with a small number of parts
type: Item
instance of: scholarly article
title: Min-max cover of a graph with a small number of parts
zbMATH Open document ID: 1387.90263
author: Boaz Farbstein
author: Asaf Levin
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6872048
zbMATH Keywords: approximation algorithms
zbMATH Keywords: routing
zbMATH Keywords: vehicle routing problems
MaRDI profile type: Publication
full work available at URL: j.disopt.2015.01.001
OpenAlex ID: W2071848017
cites work: Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
cites work: Approximations for minimum and min-max vehicle routing problems
cites work: Min-max tree covers of graphs.
cites work: Approximation hardness of min-max tree covers
cites work: Approximating the minmax rooted-tree cover in a tree
cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
cites work: Approximation Algorithms for Some Postman Problems
cites work: Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
cites work: Q4393480
cites work: Parametrized complexity theory.
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors
cites work: On general routing problems
cites work: Q4947393
DOI: 10.1016/J.DISOPT.2015.01.001
description: scientific article; zbMATH DE number 6872048