Sciweavers

ESA
2008
Springer
153views Algorithms» more  ESA 2008»
14 years 1 months ago
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, S...
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
14 years 1 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
14 years 1 months ago
Improved Randomized Results for That Interval Selection Problem
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
Leah Epstein, Asaf Levin
ESA
2008
Springer
80views Algorithms» more  ESA 2008»
14 years 1 months ago
An Optimal Dynamic Spanner for Doubling Metric Spaces
Lee-Ad Gottlieb, Liam Roditty
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
14 years 1 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
14 years 1 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
ESA
2008
Springer
83views Algorithms» more  ESA 2008»
14 years 1 months ago
An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
This paper re-examines the classical problem of minimizing maximum lateness which is defined as follows: given a collection of n jobs with processing times and due dates, in what o...
Samir Khuller, Julián Mestre
ESA
2008
Springer
97views Algorithms» more  ESA 2008»
14 years 1 months ago
The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains
We prove tight bounds on the complexity of bisectors and Voronoi diagrams on so-called realistic terrains, under the geodesic distance. In particular, if n denotes the number of tr...
Boris Aronov, Mark de Berg, Shripad Thite
ESA
2008
Springer
142views Algorithms» more  ESA 2008»
14 years 1 months ago
Edge Coloring and Decompositions of Weighted Graphs
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
Uriel Feige, Mohit Singh