Sciweavers

14 search results - page 3 / 3
» Lagrangian Relaxation and Partial Cover
Sort
View
FOCS
2003
IEEE
13 years 10 months ago
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim...
WOWMOM
2006
ACM
135views Multimedia» more  WOWMOM 2006»
13 years 11 months ago
MCMSDA: A Multi-Channel Multi-Sector Directional Antenna Wireless LAN
Recently there is an increasing interest in using directional antennas and multi-channel for Ad-hoc wireless networks. Directional antennas provide higher capacity and less multi-...
Yong Huang, Weibo Gong, Dev Gupta
TASE
2008
IEEE
13 years 5 months ago
An Optimization-Based Approach for Design Project Scheduling
Concurrent engineering has been widely used in managing design projects to speed up the design process by concurrently performing multiple tasks. Since the progress of a design tas...
Ming Ni, Peter B. Luh, Bryan Moser
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
14 years 5 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb