2137 search results - page 100 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
WEA
2005
Springer
15 years 7 months ago
2005
Springer
Vectors [Extended Abstract] Pekka Orponen and Satu Elisa Schaeffer Laboratory for Theoretical Computer Science, P.O. Box 5400 FI-02015 TKK Helsinki University of Technology, Finlan...
127
click to vote
COMPGEOM
2004
ACM
15 years 7 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
131
click to vote
WADS
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
131
click to vote
SIAMCO
2002
15 years 1 months ago
2002
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Abstract: We introduce the snowblower problem (SBP), a new optimization problem that is closely related to milling problems and to some material-handling problems. The objective in...