Sciweavers

192 search results - page 30 / 39
» A Constant-Factor Approximation Algorithm for the Multicommo...
Sort
View
APPROX
2009
Springer
99views Algorithms» more  APPROX 2009»
14 years 3 months ago
Resource Minimization Job Scheduling
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
Julia Chuzhoy, Paolo Codenotti
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
14 years 8 days ago
Path Hitting in Acyclic Graphs
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
Ojas Parekh, Danny Segev
INFOCOM
2010
IEEE
13 years 7 months ago
MIMO-Aware Routing in Wireless Mesh Networks
Abstract—Multiple-input and multiple-output (MIMO) technique is considered as one of the most promising emerging wireless technologies that can significantly improve transmissio...
Shan Chu, Xin Wang
ESA
2008
Springer
111views Algorithms» more  ESA 2008»
13 years 10 months ago
Parallel Imaging Problem
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
Thành Nguyen, Éva Tardos
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
13 years 10 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro