Sciweavers

12519 search results - page 43 / 2504
» Approximation Problems Categories
Sort
View
164
Voted
FOGA
2011
14 years 6 months ago
The logarithmic hypervolume indicator
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
Tobias Friedrich, Karl Bringmann, Thomas Voß...
SIGECOM
2005
ACM
101views ECommerce» more  SIGECOM 2005»
15 years 8 months ago
Fairness and optimality in congestion games
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Na...
SSD
2005
Springer
108views Database» more  SSD 2005»
15 years 8 months ago
On Trip Planning Queries in Spatial Databases
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
Feifei Li, Dihan Cheng, Marios Hadjieleftheriou, G...
142
Voted
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
15 years 8 months ago
Minimum spanning trees made easier via multi-objective optimization
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
Frank Neumann, Ingo Wegener
154
Voted
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 3 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye