7930 search results - page 611 / 1586 » Greedy in Approximation Algorithms |
194
click to vote
SIBGRAPI
2003
IEEE
16 years 14 days ago
2003
IEEE
The classical Douglas-Peucker line-simplification algorithm is recognized as the one that delivers the best perceptual representations of the original lines. It is used extensivel...
224
click to vote
HSNMC
2003
Springer
16 years 12 days ago
2003
Springer
Various Internet applications involve multiple parties and usually adopt a one-to-many communication paradigm (multicast). The presence of multiple receivers in a multicast session...
200
click to vote
INFOCOM
1999
IEEE
15 years 11 months ago
1999
IEEE
Abstract--CEDAR is an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and maintenance of a self-organizing routing infr...
160
click to vote
EVOW
2006
Springer
15 years 11 months ago
2006
Springer
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...
184
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...