Efficient algorithms for robustness in resource allocation and scheduling problems

DOI10.1016/j.tcs.2005.11.023zbMath1090.90079OpenAlexW2093995619MaRDI QIDQ818137

Roberto Solis-Oba, Greg N. Frederickson

Publication date: 24 March 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.11.023

zbMATH Keywords

optimizationrobustnessschedulingpartition matroid

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improving the location of minisum facilities through network modification
• A linear-time algorithm for a special case of disjoint set union
• Modifying edges of a network to obtain short subgraphs
• Graph traversals, genes and matroids: An efficient case of the travelling salesman problem
• Time bounds for selection
• Scheduling unit-time tasks with integer release times and deadlines
• On the computational power of pushdown automata
• An approach to nonlinear programming
• Bottleneck Capacity Expansion Problems with General Budget Constraints
• A General Algorithm for the Optimal Distribution of Effort
• Efficient algorithms for a family of matroid intersection problems
• Solution techniques for some allocation problems
• Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
• Maximizing the minimum source-sink path subject to a budget constraint
• Critical Load Factors in Two-Processor Distributed Systems
• Improved Algorithms for Bipartite Network Flow
• A capacity scaling algorithm for the constrained maximum flow problem
• The network inhibition problem
• On Budgeted Optimization Problems

This page was built for publication: Efficient algorithms for robustness in resource allocation and scheduling problems