480 search results - page 17 / 96 » Approximate and exact algorithms for the fixed-charge knapsa... |
IPL
2007
13 years 7 months ago
2007
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
IAT
2006
IEEE
14 years 1 months ago
2006
IEEE
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
GIS
2004
ACM
14 years 8 months ago
2004
ACM
The advances in wireless communication and decreasing costs of mobile devices have enabled users to access desired information at any time. Coupled with positioning technologies l...