Filters








517 Hits in 3.7 sec

Graph Bisection with Pareto-Optimization [article]

Michael Hamann, Ben Strasser
2017 arXiv   pre-print
This makes it well-suited for large graphs with small cuts, such as road graphs, which are our primary application.  ...  We introduce FlowCutter, a novel algorithm to compute a set of edge cuts or node separators that optimize cut size and balance in the Pareto-sense.  ...  Conclusion We introduce FlowCutter, a graph bisection algorithm that optimizes balance and cut size in the Pareto sense.  ... 
arXiv:1504.03812v3 fatcat:dchyjh3vdvfxrok4w5iot2e7om

Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems [chapter]

Cristina Bazgan, Laurent Gourvès, Jérôme Monnot
2012 Lecture Notes in Computer Science  
We investigate the problem of approximating the Pareto set of biobjective optimization problems with a given number of solutions.  ...  We derive existence and constructive approximation results for the biobjective versions of Max Bisection, Max Partition, Max Set Splitting and Max Matching. ⋆  ...  Max Bisection Given a graph G = (V, E) with non negative weights on the edges, the Max Bisection problem consists of finding a bipartition of the vertex set V into two sets of equal size such that the  ... 
doi:10.1007/978-3-642-29116-6_20 fatcat:x5rjtck6lnedpa25in5uxmpqcm

Approximation with a fixed number of solutions of some multiobjective maximization problems

Cristina Bazgan, Laurent Gourvès, Jérôme Monnot
2013 Journal of Discrete Algorithms  
Max Bisection Given a graph G = (V, E) with non negative weights on the edges, the Max Bisection problem consists of finding a bipartition of the vertex set V into two sets of equal size such that the  ...  or the Pareto set (see [8] about multiobjective combinatorial optimization).  ... 
doi:10.1016/j.jda.2013.06.006 fatcat:4dckpiifsrh6nbjdh2o2gplnwe

On the Fastest Vickrey Algorithm

Elena Grigorieva, P. Jean-Jacques Herings, Rudolf Muller
2007 Social Science Research Network  
For the case of two bidders, we show the bisection auction to be optimal according to the third criterion. The bisection auction is therefore optimal in a very strong sense.  ...  We show that Pareto optimal Vickrey algorithms do not exist and that worst case analysis is of no use in discriminating between Vickrey algorithms.  ...  N = {1, 2}, the bisection algorithm is optimal. We know that the bisection algorithm coincides with the modified bisection algorithm. We show that the bisection algorithm is optimal.  ... 
doi:10.2139/ssrn.1260203 fatcat:irpj5lth2fbpvkv63rysxbcwwu

On the Fastest Vickrey Algorithm

Elena Grigorieva, P. Jean-Jacques Herings, Rudolf Müller, Dries Vermeulen
2009 Algorithmica  
For the case of two bidders, we show the bisection auction to be optimal according to the third criterion. The bisection auction is therefore optimal in a very strong sense.  ...  We show that Pareto optimal Vickrey algorithms do not exist and that worst case analysis is of no use in discriminating between Vickrey algorithms.  ...  N = {1, 2}, the bisection algorithm is optimal. We know that the bisection algorithm coincides with the modified bisection algorithm. We show that the bisection algorithm is optimal.  ... 
doi:10.1007/s00453-009-9285-4 fatcat:rxf7w3eyofb4tfrw5y2tt2qfci

The Complexity of Bottleneck Labeled Graph Problems

Refael Hassin, Jérôme Monnot, Danny Segev
2008 Algorithmica  
We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory.  ...  Given a connected graph G = (V, E) on 2n vertices, a bisection is a cut (V 1 , V 2 ) in G with |V 1 | = |V 2 | = n.  ...  The decision version of bisection width asks to determine, for a given integer k, whether there exists a bisection with at most k edges.  ... 
doi:10.1007/s00453-008-9261-4 fatcat:vdv7wuagk5aqllzzb2ha5y6fri

Real-Time Stochastic Kinodynamic Motion Planning via Multiobjective Search on GPUs [article]

Brian Ichter and Edward Schmerling and Ali-akbar Agha-mohammadi and Marco Pavone
2017 arXiv   pre-print
for the optimization objective and an approximation of CP.  ...  This is performed by a massively parallel multiobjective search, here implemented with a focus on GPUs.  ...  Upon completion of this graph exploration phase, a bisection search is performed over the Pareto optimal set of plans reaching the goal according to their approximate CP.  ... 
arXiv:1607.06886v3 fatcat:aot7skrfi5frzll3yok5mr5qoq

Designing an exascale interconnect using multi-objective optimization

Jose A. Pascual, Joshua Lant, Andrew Attwood, Caroline Concatto, Javier Navaridas, Mikel Lujan, John Goodacre
2017 2017 IEEE Congress on Evolutionary Computation (CEC)  
The way these computing elements are connected with each other (network topology) has a strong impact on many performance characteristics.  ...  In addition, a comparison with a wellknown topology reveals that the generated solutions can provide better topological characteristics and also higher performance for parallel applications.  ...  Given B a function that returns the bisection of a graph, the first objective function to maximize is defined as follows: f 1 (s) : B(G) (3) where G is the graph that represents the topology.  ... 
doi:10.1109/cec.2017.7969572 dblp:conf/cec/PascualLACNLG17 fatcat:f56hhpztdvbjxgqso7anwyiol4

Interleaving methods for hybrid system-level MPSoC design space exploration

Roberta Piscitelli, Andy D. Pimentel
2012 2012 International Conference on Embedded Computer Systems (SAMOS)  
By interleaving these analytical estimations with simulations, our hybrid approach significantly reduces the number of simulations that are needed during the process of DSE.  ...  This paper presents and studies different strategies for interleaving fast but less accurate analytical performance estimations with slower but more accurate simulations during DSE.  ...  A Pareto optimal set with a large value for the hypervolume is desirable [19] . The normalized ∇ metric [5] measures the spread of solutions.  ... 
doi:10.1109/samos.2012.6404152 dblp:conf/samos/PiscitelliP12 fatcat:ugz3onnvirhbnp5fkkh6pv7jzu

Optimal placement of valves in a water distribution network with CLP(FD)

MASSIMILIANO CATTAFI, MARCO GAVANELLI, MADDALENA NONATO, STEFANO ALVISI, MARCO FRANCHINI
2011 Theory and Practice of Logic Programming  
This application deals with one aspect of the design of a water distribution network, i.e., the valve isolation system design.  ...  We take the formulation of the problem by Giustolisi and Savić (2008 Optimal design of isolation valve system for water distribution networks.  ...  The comparison of the near-Pareto-optimal frontier and the true Pareto-optimal frontier obtained with our CLP(FD) program is shown in Figure 5 .  ... 
doi:10.1017/s1471068411000275 fatcat:kwger46cqrfglhsz2ytjbdntmi

Choquet-based optimisation in multiobjective shortest path and spanning tree problems

Lucie Galand, Patrice Perny, Olivier Spanjaard
2010 European Journal of Operational Research  
This paper is devoted to the search of Choquet-optimal solutions in finite graph problems with multiple objectives.  ...  Under these assumptions, we focus on the fast determination of Choquet-optimal paths and spanning trees.  ...  In order to discriminate between the Pareto-optimal solutions, we might use the CED model with a non- Table 1 . Table 1 CED values of Pareto-optimal solution (case 1).  ... 
doi:10.1016/j.ejor.2009.10.015 fatcat:p7i3gpql7jhbtbykakanlmlvdq

Multi-objective gene-pool optimal mixing evolutionary algorithms

Ngoc Hoang Luong, Han La Poutré, Peter A.N. Bosman
2014 Proceedings of the 2014 conference on Genetic and evolutionary computation - GECCO '14  
Second, clustering can be crucial if different parts of the Pareto-optimal front need to be handled differently. By combining these elements, we construct a multi-objective GOMEA (MO-GOMEA).  ...  methodology for solving single objective (SO) optimization problems with superior performance compared to classic genetic algorithms (GAs) and estimation-of-distribution algorithms (EDAs).  ...  For the problems Zeromax -Onemax, Trap-5 -Inverse Trap-5, and LOTZ, the Pareto-optimal fronts are known, so to this end, we perform bisection.  ... 
doi:10.1145/2576768.2598261 dblp:conf/gecco/LuongPB14 fatcat:sfhoquvxinfdphrbstamen7laq

SpectralFly: Ramanujan Graphs as Flexible and Efficient Interconnection Networks [article]

Stephen Young, Sinan Aksoy, Jesun Firoz, Roberto Gioiosa, Tobias Hagge, Mark Kempton, Juan Escobedo, Mark Raugas
2022 arXiv   pre-print
One approach is to seek optimal or near-optimal families of graphs with respect to a particular graph theoretic property, such as diameter.  ...  In this work, we consider topologies which optimize the spectral gap.  ...  Pareto frontier.  ... 
arXiv:2104.11725v2 fatcat:cdavfzaepjaefpbqo2hvlzjbo4

Information Extraction from Larger Multi-layer Social Networks [article]

Brandon Oselio, Alex Kulesza, Alfred Hero
2015 arXiv   pre-print
Using the concept of Pareto optimality, community detection in this multi-layer setting is formulated as a multiple criterion optimization problem.  ...  We propose an algorithm for finding an approximate Pareto frontier containing a family of solutions.  ...  The objective is to find solutions that are approximately Pareto optimal.  ... 
arXiv:1507.00087v1 fatcat:hnzs5bz5f5hdve663zzwnfv2sa

Network Partitioning Domain Knowledge Multiobjective Application Mapping for Large-Scale Network-on-Chip

Yin Zhen Tei, Yuan Wen Hau, N. Shaikh-Husin, M. N. Marsono
2014 Applied Computational Intelligence and Soft Computing  
The proposed genetic operator is compared with state-of-the-art genetic operators in terms of solution quality. In this work, multiobjective optimization of energy and thermal-balance is considered.  ...  The initial population of GA is initialized with network partitioning (NP) while the crossover operator is guided with knowledge on communication demands.  ...  Chaco performs bisection partitioning whereas hMetis performs the -way partitioning.  ... 
doi:10.1155/2014/867612 fatcat:3yzgm7mjbnalzj5tmn5qfanjly
« Previous Showing results 1 — 15 out of 517 results