Skip to content

Home Search Authors Pakistan News Saved

SciRah

SciRah does not host or store research papers. Results come live from free, official scholarly APIs, and every paper links back to its original source.

Data sources

OpenAlex
Semantic Scholar
Crossref
CORE
arXiv
PubMed

Privacy policy Terms of service

Busy Time Scheduling on a Bounded Number of Machines (Extended Abstract) · SciRah

conference paper

Busy Time Scheduling on a Bounded Number of Machines (Extended Abstract)

Frederic Koehler^a✉, Samir Khuller^b

^aDepartment of Mathematics, MIT, Cambridge, MA, 02139, USA
^bDepartment of Computer Science, University of Maryland, College Park, MD, 20742, USA
✉Corresponding author

Lecture notes in computer science Springer Science+Business Media2017-01-01 13 citations19 references

Looking for the full paper…

Share

Busy Time Scheduling on a Bounded Number of Machines (Extended Abstract)

Export

PDF Details, abstract & AI summary Word (.docx) Editable document One-slide summary Image or PDF for presentations

Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.

Abstract

No abstract is available from our sources. Use “Read paper” to view it.

Plain-language summary

Discussion

Published in

Lecture notes in computer science →

Springer Science+Business Media — publisher profile →

Topics

Optimization and Search Problems Scheduling and Optimization Algorithms Complexity and Algorithms in Graphs

Identifiers

DOI: 10.1007/978-3-319-62127-2_44
OpenAlex: W2726686740

Metadata from OpenAlex, Crossref.