367 search results - page 66 / 74 » Tight lower bounds for the online labeling problem |
19
Voted
STOC
1999
ACM
13 years 11 months ago
1999
ACM
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...
SODA
1996
ACM
13 years 8 months ago
1996
ACM
We consider the problem faced by a mobile robot that has to reach a given target by traveling through an unmapped region in the plane containing oriented rectangular obstacles. We...
IPCO
2007
13 years 9 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
SIGPRO
2010
13 years 5 months ago
2010
This paper deals with the on-line carrier phase estimation in a digital receiver. We consider a Brownian phase evolution in a Data Aided scenario. The proposed study uses an overs...
PC
2008
13 years 7 months ago
2008
In this paper, we assess the impact of heterogeneity on scheduling independent tasks on master-slave platforms. We assume a realistic one-port model where the master can communica...