Sciweavers

ESA
2006
Springer
105views Algorithms» more  ESA 2006»
15 years 6 months ago
Near-Entropy Hotlink Assignments
Consider a rooted tree T of arbitrary maximum degree d representing a collection of n web pages connected via a set of links, all reachable from a source home page represented by ...
Karim Douïeb, Stefan Langerman
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
15 years 6 months ago
Dynamic Programming and Fast Matrix Multiplication
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Frederic Dorn
ESA
2006
Springer
96views Algorithms» more  ESA 2006»
15 years 6 months ago
Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
Brian C. Dean, Michel X. Goemans, Nicole Immorlica
ESA
2006
Springer
89views Algorithms» more  ESA 2006»
15 years 6 months ago
Spectral Clustering by Recursive Partitioning
Anirban Dasgupta, John E. Hopcroft, Ravi Kannan, P...
ESA
2006
Springer
95views Algorithms» more  ESA 2006»
15 years 6 months ago
Distributed Almost Exact Approximations for Minor-Closed Families
Andrzej Czygrinow, Michal Hanckowiak