Results 251 to 260 of about 1,611,510 (293)
Some of the next articles are maybe not open access.
A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs
Embedded Systems and Applications, 2017The Capacitated Vehicle Routing problem is a generalization of the Traveling Salesman problem in which a set of clients must be visited by a collection of capacitated tours.
Amariah Becker, P. Klein, David Saulpic
semanticscholar +1 more source
Extending Search Phases in the Micali-Vazirani Algorithm
The Sea, 2017The Micali-Vazirani algorithm is an augmenting path algorithm that offers the best theoretical runtime of O(n0.5m) for solving the maximum cardinality matching problem for non-bipartite graphs.
Michael Huang, C. Stein
semanticscholar +1 more source
Optimizing Traffic Signal Settings for Public Transport Priority
Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, 2017In order to promote public transport many municipalities use traffic signal control with a priority for buses or trams. In this paper, we address the problem of finding optimal passive transit signal priority settings.
R. Scheffler, M. Strehler
semanticscholar +1 more source
Emission properties and energy transfer in Perylene-Rhodamine 6 G co-doped polymeric fiber
, 2016This Letter presents the fabrication and characterization of a perylene (Per) and Rhodamine 6 G (Rh 6 G) co-doped polymeric fiber. The spectroscopic properties (luminescence spectra, attenuation, energy transfer) of the co-doped polymethyl ...
P. Miluski+3 more
semanticscholar +1 more source
Computational study about through-bond and through-space interactions in [2.2]cyclophanes.
Journal of Physical Chemistry A, 2007An analysis of the electron density, obtained by B3PW91/6-31+G(d,p), B3LYP/6-31+G(d,p), and MP2/6-31+G(d,p) for [2,2]cyclophanes isomers, [2.2]paracyclophane, anti-[2.2]metacyclophane, syn-[2.2]metacyclophane, and [2.2]metaparacyclophane, was made ...
G. Caramori, S. Galembeck
semanticscholar +1 more source
Delay-Robust Journeys in Timetable Networks with Minimum Expected Arrival Time
Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, 2014We study the problem of computing delay-robust routes in timetable networks. Instead of a single path we compute a decision graph containing all stops and trains/vehicles that might be relevant. Delays are formalized using a stochastic model. We show how
Julian Dibbelt, Ben Strasser, D. Wagner
semanticscholar +1 more source
Fully Dynamic Connectivity Oracles under General Vertex Updates
International Symposium on Algorithms and Computation, 2017We study the following dynamic graph problem: given an undirected graph G, we maintain a connectivity oracle between any two vertices in G under any on-line sequence of vertex deletions and insertions with incident edges.
Kengo Nakamura
semanticscholar +1 more source
Minimum s-t cut in undirected planar graphs when the source and the sink are close
Symposium on Theoretical Aspects of Computer Science, 2011Consider the minimum s t cut problem in an embedded undirected planar graph. Let p be the minimum number of faces that a curve from s to t passes through.
Haim Kaplan, Yahav Nussbaum
semanticscholar +1 more source
A Model-Based Heuristic to the Min Max K-Arc Routing for Connectivity Problem
Student Conference on Operational Research, 2014We consider the post-disaster road clearing problem with the goal of restoring network connectivity in shortest time. Given a set of blocked edges in the road network, teams positioned at depot nodes are dispatched to open a subset of them that ...
V. Akbari, F. Salman
semanticscholar +1 more source