Sciweavers

17760 search results - page 12 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
WADS
1993
Springer
87views Algorithms» more  WADS 1993»
13 years 11 months ago
A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms
Lars Arge, Mikael Knudsen, Kirsten Larsen
ESA
2000
Springer
96views Algorithms» more  ESA 2000»
13 years 11 months ago
Fast Algorithms for Even/Odd Minimum Cuts and Generalizations
András A. Benczúr, Ottilia Fül&...
CCO
2001
Springer
256views Combinatorics» more  CCO 2001»
14 years 7 days ago
General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms
In this paper we survey the basic features of state-of-the-art branch-and-cut algorithms for the solution of general mixed integer programming problems. In particular we focus on p...
Alexander Martin
SIAMCOMP
2012
11 years 10 months ago
Randomized Competitive Algorithms for Generalized Caching
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor