503 search results - page 90 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
123
click to vote
WINE
2009
Springer
15 years 10 months ago
2009
Springer
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
131
click to vote
ANOR
2005
15 years 3 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
116
click to vote
SWAT
2004
Springer
15 years 8 months ago
2004
Springer
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
134
click to vote
INFOCOM
2002
IEEE
15 years 8 months ago
2002
IEEE
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...
130
click to vote
ANCS
2009
ACM
15 years 1 months ago
2009
ACM
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...