Sciweavers

3192 search results - page 155 / 639
» The minimum latency problem
Sort
View
CCCG
2007
15 years 5 months ago
Improved Layouts of the Multigrid Network
In a previous paper, Calamoneri and Massini studied the problem of drawing the multigrid network in “a grid of minimum area”. In this paper we show that we can draw the multig...
Shabnam Aziza, Therese C. Biedl
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
15 years 5 months ago
Improved results for directed multicut
We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an Ç´ÔÒµapproximation. This improves on the previous approximation guarantee of ...
Anupam Gupta
FOCS
2010
IEEE
15 years 2 months ago
A Non-linear Lower Bound for Planar Epsilon-Nets
We show that the minimum possible size of an -net for point objects and line (or rectangle)ranges in the plane is (slightly) bigger than linear in 1/ . This settles a problem rais...
Noga Alon
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
15 years 5 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
FOCS
2005
IEEE
15 years 9 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...