2714 search results - page 37 / 543 » Approximation Schemes for Scheduling |
FODO
1989
Springer
15 years 4 months ago
1989
Springer
DIALM
2005
ACM
15 years 2 months ago
2005
ACM
102
Voted
NIPS
2008
15 years 1 months ago
2008
106
click to vote
SODA
1998
ACM
15 years 1 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
ESA
2010
Springer
15 years 1 months ago
2010
Springer