We examine how many and what kind of firms ultimately rely on foreign inputs, sell to foreign
markets, and are affected by trade shocks. To capture that firms can trade indirectly by …

We develop a model of endogenous production networks with fixed costs in the formation of
links between firms. We show that the closed economy equilibrium is unique if the set of …

Abstract The Bellman-Ford algorithm is a basic primitive for computing single source
shortest paths in graphs with negative weight edges. Its running time is governed by the …

The minimum feedback arc set problem (FASP), which seeks to remove a minimum set of
arcs from a directed graph to make the remaining graph acyclic, is fundamental in graph …

Stability maintenance in systems refers to the capacity to preserve inherent stability
characteristics. In this article, stability maintenance of large boolean networks (BNs) …

The chapter deals with the problem and the name, origin of the FAS, and its description.
Hardness is argued, including in the extended version. Various often used, and some not …

Testing Upward Planarity of Partial 2-Trees | SpringerLink Skip to main content
Advertisement Springer Nature Link Account Menu Find a journal Publish with us Track …

It is well known that Minimum Feedback Arc Set is in a general case NP-complete. There are
different kinds of exact, heuristic and approximation algorithms for solving this problem, but …

Features such as estimated delivery time windows and live tracking of shipments play a key
role in improving the customer experience in last-mile delivery. The building blocks for …

The offline evaluation of search requires us to define a standard against which we measure
the quality of results returned by a ranker. Frequently this standard is defined in absolute …