Sciweavers

102 search results - page 4 / 21
» Better Algorithms and Bounds for Directed Maximum Leaf Probl...
Sort
View
FOCS
2008
IEEE
13 years 6 months ago
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
Deeparnab Chakrabarty, Gagan Goel
WEA
2010
Springer
338views Algorithms» more  WEA 2010»
14 years 3 days ago
New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
Abstract. This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery. We propose undirected and directed two-commodity flow formulations, which are bas...
Anand Subramanian, Eduardo Uchoa, Luiz Satoru Ochi
ICASSP
2011
IEEE
12 years 9 months ago
Direction-of-arrival estimation using acoustic vector sensors in the presence of noise
A vector-sensor consisting of a monopole sensor collocated with orthogonally oriented dipole sensors can be used for direction-ofarrival (DOA) estimation. A method is proposed to ...
Dovid Levin, Sharon Gannot, Emanuel A. P. Habets
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
13 years 11 months ago
Evolutionary algorithms and matroid optimization problems
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
Joachim Reichel, Martin Skutella
COMPGEOM
2003
ACM
13 years 10 months ago
Cost-driven octree construction schemes: an experimental study
Given a scene consisting of objects, ray shooting queries answer with the first object encountered by a given ray, and are used in ray tracing and radiosity for rendering photo-r...
Boris Aronov, Hervé Brönnimann, Allen ...