Filters








5 Hits in 3.2 sec

Towards A Personal Shopper's Dilemma: Time vs Cost [article]

Samiul Anwar, Francesco Lettich, Mario A. Nascimento
2020 arXiv   pre-print
the goods, in order to maximize his/her potential profit when reselling them.  ...  It is in the personal shopper's best interest to find (shopping) routes that (i) minimize the time serving a customer, in order to be able to serve more customers, and (ii) minimize the price paid for  ...  In the context of our work the literature targeting bicriteria networks [8] is particularly relevant.  ... 
arXiv:2008.11705v2 fatcat:axds2ozulncsrpwxah425fkgaa

Linear path skylines in multicriteria networks

Michael Shekelyan, Gregor Josse, Matthias Schubert
2015 2015 IEEE 31st International Conference on Data Engineering  
In this paper, we introduce multicriteria linear path skyline queries.  ...  Depending on the network multiple cost criteria might be of interest. Examples are travel time, energy consumption and toll fees in road networks.  ...  [2] introduces a label correcting approach to compute linear path skylines in bicriteria networks which outperformed previous approaches.  ... 
doi:10.1109/icde.2015.7113306 dblp:conf/icde/ShekelyanJS15 fatcat:qzluu4bqv5g67bsfy75wvwhj4a

Mining Uncertain and Probabilistic Data: problems, Challenges, Methods, and Applications

Jian Pei, Ming Hua
2008 Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD 08  
, β)-bicriteria Approximation • Optimal k-center, k-means, and k-median are NPhard even for certain data • A (α, β)-bicriteria approximation to k-clustering finds a clustering of size βk whose cost is  ...  Answering PT-k Queries • Position probability Pr(t i ,j) -The probability that t i is ranked at the j-th position -E.g.  ... 
doi:10.1145/1401890.1551568 fatcat:lg2jfeisqfeeda5pbtzugy4jzu

Framing Algorithms for Approximate Multicriteria Shortest Paths

Nicolas Hanusse, David Ilcinkas, Antonin Lentz, Christos D. Zaroliagis, Dennis Huisman
2020 Algorithmic Approaches for Transportation Modeling, Optimization, and Systems  
Finally, we provide a small experimental study in order to confirm the relevance of our Frame algorithm.  ...  We propose in this article new algorithms to compute approximated Pareto paths in any dimension.  ...  We take the graphs given by the 9 th challenge of DIMACS [7] . It offers bicriteria (distance and edge traversal time) datasets on road networks for different USA states.  ... 
doi:10.4230/oasics.atmos.2020.11 dblp:conf/atmos/HanusseIL20 fatcat:ywen6l7pkvfkniapuwollob66q

OASIcs, Volume 85, ATMOS 2020, Complete Volume [article]

Dennis Huisman, Christos D. Zaroliagis
2020
However, changes in the railway infrastructure to accommodate the increase in traffic are expensive and take a long time.  ...  As many passenger and freight trains as possible should be able to use the infrastructure, of course in compliance with the necessary safety requirements.  ...  We take the graphs given by the 9 th challenge of DIMACS [7] . It offers bicriteria (distance and edge traversal time) datasets on road networks for different USA states.  ... 
doi:10.4230/oasics.atmos.2020 fatcat:cfergu24w5f73ajydwnxvac3p4