Capacitated max -Batching with Interval Graph Compatibilities

DOI10.1007/978-3-642-13731-0_18zbMath1284.05217OpenAlexW2152452513MaRDI QIDQ3569889

Tim Nonner

Publication date: 22 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13731-0_18

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Related Items (3)

Bounded max-colorings of graphs ⋮ Clique Clustering Yields a PTAS for max-Coloring Interval Graphs ⋮ Clique partitioning with value-monotone submodular cost

This page was built for publication: Capacitated max -Batching with Interval Graph Compatibilities