Sciweavers

17760 search results - page 12 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
WADS
1993
Springer
87views Algorithms» more  WADS 1993»
15 years 1 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»
15 years 1 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»
15 years 2 months 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
13 years 4 days 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