scientific article; zbMATH DE number 7758357
From MaRDI portal
Publication:6084420
DOI10.4230/lipics.approx/random.2020.55arXiv1907.08304MaRDI QIDQ6084420
N. Kumar, Unnamed Author, Syamantak Das
Publication date: 31 October 2023
Full work available at URL: https://arxiv.org/abs/1907.08304
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- Min-max tree covers of graphs.
- Centrality of trees for capacitated \(k\)-center
- Approximation hardness of min-max tree covers
- Approximation schemes for scheduling on parallel machines
- Approximating the minmax rooted-tree cover in a tree
- An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints
- An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation
- Saving an epsilon
- Bounds and Heuristics for Capacitated Routing Problems
- Approximation Algorithms for Min–Max Tree Partition
- Tight Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs
- Iterative Partial Rounding for Vertex Cover with Hard Capacities
- A new approximation technique for resource‐allocation problems
- Approximations for minimum and min-max vehicle routing problems
- On the Cube of a Graph
This page was built for publication:
