Sciweavers

ESA
2006
Springer
134views Algorithms» more  ESA 2006»
14 years 3 months ago
Graph Coloring with Rejection
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
Leah Epstein, Asaf Levin, Gerhard J. Woeginger
ESA
2006
Springer
108views Algorithms» more  ESA 2006»
14 years 3 months ago
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
We consider FIFO buffer management for switches providing differentiated services. In each time step, an arbitrary number of packets arrive, and only one packet can be sent. The bu...
Matthias Englert, Matthias Westermann
ESA
2006
Springer
109views Algorithms» more  ESA 2006»
14 years 3 months ago
Multiline Addressing by Network Flow
We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize amplitude of the electrical current through the diodes whic...
Friedrich Eisenbrand, Andreas Karrenbauer, Martin ...
ESA
2006
Springer
82views Algorithms» more  ESA 2006»
14 years 3 months ago
Preemptive Online Scheduling: Optimal Algorithms for All Speeds
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...
Tomás Ebenlendr, Wojciech Jawor, Jiri Sgall
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
14 years 3 months ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
Christoph Dürr, Mathilde Hurand
ESA
2006
Springer
118views Algorithms» more  ESA 2006»
14 years 3 months ago
Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods
Much recent work in the theoretical computer science, linear algebra, and machine learning has considered matrix decompositions of the following form: given an m
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
14 years 3 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»
14 years 3 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»
14 years 3 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»
14 years 3 months ago
Spectral Clustering by Recursive Partitioning
Anirban Dasgupta, John E. Hopcroft, Ravi Kannan, P...