Sciweavers

1632 search results - page 47 / 327
» On special numberings of hypergraphs
Sort
View
EOR
2007
76views more  EOR 2007»
15 years 6 months ago
Lower bounds and heuristics for the Windy Rural Postman Problem
In this paper we present several heuristic algorithms and a cutting-plane algorithm for the Windy Rural Postman Problem. This problem contains a big number of important Arc Routin...
Enrique Benavent, Alessandro Carrotta, Angel Corbe...
MOR
2006
123views more  MOR 2006»
15 years 6 months ago
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
We study the multidimensional generalization of the classical Bin Packing problem: Given a collection of d-dimensional rectangles of specified sizes, the goal is to pack them into ...
Nikhil Bansal, José R. Correa, Claire Kenyo...
SIAMCOMP
2002
95views more  SIAMCOMP 2002»
15 years 6 months ago
Lower Bounds for Lucas Chains
Lucas chains are a special type of addition chains satisfying an extra condition: for the representation ak = aj + ai of each element ak in the chain, the difference aj - ai must a...
Martin Kutz
FOCS
2008
IEEE
16 years 22 days ago
Multi-unit Auctions with Budget Limits
We study multi-unit auctions where the bidders have a budget constraint, a situation very common in practice that has received relatively little attention in the auction theory li...
Shahar Dobzinski, Ron Lavi, Noam Nisan
ICASSP
2008
IEEE
16 years 22 days ago
A compressed sensing technique for OFDM channel estimation in mobile environments: Exploiting channel sparsity for reducing pilo
We consider the estimation of doubly selective wireless channels within pulse-shaping multicarrier systems (which include OFDM systems as a special case). A new channel estimation...
Georg Tauboeck, Franz Hlawatsch