Sciweavers

18 search results - page 3 / 4
» Data-dependent Bounds for the General and the Asymmetric Sta...
Sort
View
FOCS
2006
IEEE
14 years 9 days ago
Minimum Bounded Degree Spanning Trees
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
Michel X. Goemans
SIGECOM
2011
ACM
219views ECommerce» more  SIGECOM 2011»
12 years 9 months ago
GSP auctions with correlated types
The Generalized Second Price (GSP) auction is the primary method by which sponsered search advertisements are sold. We study the performance of this auction in the Bayesian settin...
Brendan Lucier, Renato Paes Leme
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
13 years 10 months ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
14 years 6 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat
EOR
2010
125views more  EOR 2010»
13 years 6 months ago
Efficient estimation of large portfolio loss probabilities in t-copula models
We consider the problem of accurately measuring the credit risk of a portfolio consisting of loans, bonds and other financial assets. One particular performance measure of interes...
Joshua C. C. Chan, Dirk P. Kroese