Efficient algorithms for robustness in resource allocation and scheduling problems
type: Item
instance of: scholarly article
title: Efficient algorithms for robustness in resource allocation and scheduling problems
zbMATH Open document ID: 1090.90079
author: Greg N. Frederickson
author: Roberto Solis-Oba
published in: Theoretical Computer Science
publication date: 2006-03-24T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5015104
zbMATH Keywords: robustness
zbMATH Keywords: optimization
zbMATH Keywords: scheduling
zbMATH Keywords: partition matroid
MaRDI profile type: Publication
full work available at URL: j.tcs.2005.11.023
OpenAlex ID: W2093995619
cites work: On the computational power of pushdown automata
cites work: A capacity scaling algorithm for the constrained maximum flow problem
cites work: Improved Algorithms for Bipartite Network Flow
cites work: Improving the location of minisum facilities through network modification
cites work: Time bounds for selection
cites work: Bottleneck capacity expansion problems with general budget constraints
cites work: Modifying edges of a network to obtain short subgraphs
cites work: Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
cites work: Solution techniques for some allocation problems
cites work: Scheduling unit-time tasks with integer release times and deadlines
cites work: Q4875228
cites work: Q5501845
cites work: Maximizing the minimum source-sink path subject to a budget constraint
cites work: Efficient algorithms for a family of matroid intersection problems
cites work: A linear-time algorithm for a special case of disjoint set union
cites work: Graph traversals, genes and matroids: An efficient case of the travelling salesman problem
cites work: Q4286721
cites work: On Budgeted Optimization Problems
cites work: A general algorithm for the optimal distribution of effort
cites work: An approach to nonlinear programming
cites work: Q4023374
cites work: The network inhibition problem
cites work: Critical Load Factors in Two-Processor Distributed Systems
cites work: Q4111952
DOI: 10.1016/J.TCS.2005.11.023
description: scientific article; zbMATH DE number 5015104