Sciweavers

193 search results - page 29 / 39
» A Lower Bound for the Shortest Path Problem
Sort
View
FSTTCS
2010
Springer
14 years 9 months ago
Combinatorial Problems with Discounted Price Functions in Multi-agent Systems
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
Gagan Goel, Pushkar Tripathi, Lei Wang
TWC
2011
291views more  TWC 2011»
14 years 6 months ago
On Optimal Cooperator Selection Policies for Multi-Hop Ad Hoc Networks
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...
Michele Rossi, Cristiano Tapparello, Stefano Tomas...
ALGORITHMICA
2005
225views more  ALGORITHMICA 2005»
14 years 11 months ago
Better Alternatives to OSPF Routing
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, ...
COR
2007
88views more  COR 2007»
14 years 11 months ago
Finding minimum and equitable risk routes for hazmat shipments
This paper deals with the generation of minimal risk paths for the road transportation of hazardous materials between an origin–destination pair of a given regional area. The ma...
Pasquale Carotenuto, Stefano Giordani, Salvatore R...
106
Voted
RECOMB
2008
Springer
15 years 12 months ago
Sorting Cancer Karyotypes by Elementary Operations
Since the discovery of the "Philadelphia chromosome" in chronic myelogenous leukemia in 1960, there is an ongoing intensive research of chromosomal aberrations in cancer....
Michal Ozery-Flato, Ron Shamir