7930 search results - page 93 / 1586 » Greedy in Approximation Algorithms |
132
click to vote
DM
2008
15 years 6 months ago
2008
The core of a game v on N, which is the set of additive games dominating v such that (N) = v(N), is a central notion in cooperative game theory, decision making and in combinator...
192
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...
181
click to vote
CLUSTER
2002
IEEE
15 years 6 months ago
2002
IEEE
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...
150
click to vote
CIKM
1999
Springer
15 years 10 months ago
1999
Springer
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
157
click to vote
ICRA
2008
IEEE
16 years 19 days ago
2008
IEEE
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...