Automata, Languages and Programming

DOI10.1007/11523468zbMath1084.90525OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716840

Jochen Könemann, Stefan H. M. Van Zwam, Stefano Leonardi, Guido Schäfer

Publication date: 10 January 2006

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

Full work available at URL: https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (3)

Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems ⋮ Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems ⋮ Fair cost-sharing methods for scheduling jobs on parallel machines

This page was built for publication: Automata, Languages and Programming