Min-max cover of a graph with a small number of parts

DOI10.1016/J.DISOPT.2015.01.001zbMath1387.90263OpenAlexW2071848017MaRDI QIDQ1751107

Boaz Farbstein, Asaf Levin

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2015.01.001

zbMATH Keywords

approximation algorithmsroutingvehicle routing problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

An overview of graph covering and partitioning ⋮ Improved approximation algorithms for some min-max and minimum cycle cover problems ⋮ Better approximability results for min-max tree/cycle/path cover problems ⋮ Approximation algorithms for some min-max postmen cover problems ⋮ New approximation algorithms for the minimum cycle cover problem

Cites Work

• Unnamed Item
• Unnamed Item
• Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
• Min-max tree covers of graphs.
• Approximation algorithms for scheduling unrelated parallel machines
• Approximation hardness of min-max tree covers
• Approximating the minmax rooted-tree cover in a tree
• Parametrized complexity theory.
• Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• On general routing problems
• Approximation Algorithms for Some Postman Problems
• Approximations for minimum and min-max vehicle routing problems
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

This page was built for publication: Min-max cover of a graph with a small number of parts