Capacitated max-batching with interval graph compatibilities
type: Item
instance of: scholarly article
title: Capacitated max-batching with interval graph compatibilities
zbMATH Open document ID: 1333.05246
author: Tim Nonner
published in: Theoretical Computer Science
publication date: 2015-12-28T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6524282
zbMATH Keywords: approximation algorithms
zbMATH Keywords: scheduling
zbMATH Keywords: approximation schemes
zbMATH Keywords: NP-hardness
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.10.047
OpenAlex ID: W2186826687
cites work: A quasi-PTAS for unsplittable flow on line graphs
cites work: Scheduling unit tasks to minimize the number of idle periods
cites work: Latency Constrained Aggregation in Sensor Networks
cites work: Restrictions of graph partition problems. I
cites work: Dynamic scheduling on a single batch processing machine with split compatibility graphs
cites work: On the max coloring problem
cites work: Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
cites work: Batch processing with interval graph compatibilities between tasks
cites work: Q4198056
cites work: Clique partitioning of interval graphs with submodular costs on the cliques
cites work: Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
cites work: Approximation schemes for covering and packing problems in image processing and VLSI
cites work: Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs
cites work: Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
cites work: Automata, Languages and Programming
cites work: Max-coloring and online coloring with bandwidths on interval graphs
DOI: 10.1016/J.TCS.2015.10.047
Recommended article: Capacitated max -Batching with Interval Graph Compatibilities
Recommended article: Batch processing with interval graph compatibilities between tasks
Recommended article: PARALLEL MAXIMUM MATCHING ALGORITHMS IN INTERVAL GRAPHS
Recommended article: Parallel algorithms for maximum matching in complements of interval graphs and related problems
Recommended article: Scheduling a batch processing machine with bipartite compatibility graphs
Recommended article: Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs
Recommended article: Scheduling on a batch processing machine with split compatibility graphs
Recommended article: Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
Recommended article: On the Solution of a Graph Partitioning Problem under Capacity Constraints
Recommended article: Optimal parallel time bounds for the maximum clique problem on intervals
description: scientific article; zbMATH DE number 6524282