scientific article; zbMATH DE number 7278056
From MaRDI portal
Publication:5136271
DOI10.4230/LIPIcs.ISAAC.2017.51zbMath1457.68127arXiv1710.00950MaRDI QIDQ5136271
Kazuhisa Makino, Yasushi Kawase, Hanna Sumita, Kei Kimura
Publication date: 25 November 2020
Full work available at URL: https://arxiv.org/abs/1710.00950
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the configuration-LP for scheduling on unrelated machines
- 3-partitioning problems for maximizing the minimum load
- Approximation algorithms for scheduling unrelated parallel machines
- Lower bounds and modified LPT algorithm for \(k\)-partitioning problems with partition matroid constraint
- \(k\)-partitioning problems with partition matroid constraint
- Matroid matching and some applications
- The \(k\)-partitioning problem
- A tight bound for 3-partitioning
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- \(\kappa\)-partitioning problems for maximizing the minimum load
- Approximation algorithms for \(k\)-partitioning problems with partition matroid constraint
- On uniform \(k\)-partition problems
- Matroid Matching: The Power of Local Search
- A weighted matroid intersection algorithm
- Analytical approach to parallel repetition
- Transversals and matroid partition
- Minimum partition of a matroid into independent subsets
- Constrained partitioning problems
- Combinatorial optimization. Theory and algorithms.
- The dense \(k\)-subgraph problem
- Bounds for the cardinality constrained \(P \|C_{max}\) problem
