Quantitatively fair scheduling
TL;DR: Finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet are considered, and it is shown that the problem of checking whether there exists a winning strategy is Co-NP-complete.
read more
About: This article is published in Theoretical Computer Science. The article was published on 01 Jan 2012. and is currently open access. The article focuses on the topics: Longest path problem & Time complexity.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Quantitative Aspects of Programming Languages and Systems over the past $2^4$ years and beyond
TL;DR: The aim of this survey is to revisit such achievements and results from the standpoint of QAPL and its community.
Quantitative Aspects of Programming Languages and Systems over the past 2^4 years and beyond
Alessandro Aldini
- 20 Jan 2020
TL;DR: A survey of quantitative aspects of programming languages and systems (QAPL) can be found in this paper, where a variety of theoretical achievements and automated techniques have contributed to make quantitative modeling and verification mainstream in the research community.
References
•Book
Introduction to Algorithms
Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest +2 more
- 01 Jan 1990
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
24.8K
•Book
Theory of Linear and Integer Programming
Alexander Schrijver
- 01 Dec 1986
TL;DR: Introduction and Preliminaries.
•Book
Integer and Combinatorial Optimization
George L. Nemhauser,Laurence A. Wolsey +1 more
- 01 Jan 1988
TL;DR: This chapter discusses the Scope of Integer and Combinatorial Optimization, as well as applications of Special-Purpose Algorithms and Matching.
Integer and Combinatorial Optimization: Nemhauser/Integer and Combinatorial Optimization
George L. Nemhauser,Laurence A. Wolsey +1 more
- 16 Jun 1988
Abstract: FOUNDATIONS. The Scope of Integer and Combinatorial Optimization. Linear Programming. Graphs and Networks. Polyhedral Theory. Computational Complexity. Polynomial-Time Algorithms for Linear Programming. Integer Lattices. GENERAL INTEGER PROGRAMMING. The Theory of Valid Inequalities. Strong Valid Inequalities and Facets for Structured Integer Programs. Duality and Relaxation. General Algorithms. Special-Purpose Algorithms. Applications of Special- Purpose Algorithms. COMBINATORIAL OPTIMIZATION. Integral Polyhedra. Matching. Matroid and Submodular Function Optimization. References. Indexes.
4.4K
Introduction to Algorithms, 2nd edition.
TH Cormen,CE Leiserson,RL Rivest,Cliff Stein +3 more
- 01 Jan 2001
4K