This paper provides some additional empirical evidence on the effect of exchange-rate volatility on exports. The novelties of the study include: a regime-switching model in conditional volatility is employed to better capture the exchange-rate uncertainty; a 2SLS method as suggested by Hsiao is...

This paper provides some additional empirical evidence on the effect of exchange‐rate volatility on exports. The novelties of the study include: a regime‐switching model in conditional volatility is employed to better capture the exchange‐rate uncertainty; a 2SLS method as suggested by...

We derive an equilibrium price that converges to be strong-form informationally efficient in the original Grossman-Stiglitz model (1980). Specifically, we show that when the private signal converges to be perfect or traders converge to be risk neutral, there exists a unique overall equilibrium...

The minimum weighted dominating set (MWDS) problem is one of the classic NP-hard optimization problems in graph theory with applications in many fields such as wireless communication networks. MWDS in general graphs has been showed not to have polynomial-time constant-approximation if <InlineEquation ID="IEq1"> <EquationSource...</equationsource></inlineequation>

For a connected graph <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$G=(V,E)$$</EquationSource> </InlineEquation> and a positive integral vertex weight function <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$$w$$</EquationSource> </InlineEquation>, a max-min weight balanced connected <InlineEquation ID="IEq3"> <EquationSource Format="TEX">$$k$$</EquationSource> </InlineEquation>-partition of <InlineEquation ID="IEq4"> <EquationSource Format="TEX">$$G$$</EquationSource> </InlineEquation>, denoted as <InlineEquation ID="IEq5"> <EquationSource Format="TEX">$$BCP_k$$</EquationSource> </InlineEquation>, is a partition of <InlineEquation ID="IEq6"> <EquationSource Format="TEX">$$V$$</EquationSource> </InlineEquation> into <InlineEquation ID="IEq7"> <EquationSource Format="TEX">$$k$$</EquationSource> </InlineEquation> disjoint vertex subsets <InlineEquation ID="IEq8"> <EquationSource Format="TEX">$$(V_1,V_2,\ldots ,V_k)$$</EquationSource> </InlineEquation> such that each <InlineEquation ID="IEq9"> <EquationSource...</equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation>

Using local search method, this paper provides a polynomial time approximation scheme for the minimum vertex cover problem on <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$d$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mi>d</mi> </math> </EquationSource> </InlineEquation>-dimensional ball graphs where <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$$d \ge 3$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mrow> <mi>d</mi> <mo>≥</mo> <mn>3</mn> </mrow> </math> </EquationSource> </InlineEquation>. The key to the proof is a new separator theorem for ball graphs in higher dimensional space....</equationsource></equationsource></inlineequation></equationsource></equationsource></inlineequation>

In the Minimum k-Path Connected Vertex Cover Problem (MkPCVCP), we are given a connected graph G and an integer k ≥ 2, and are required to find a subset C of vertices with minimum cardinality such that each path with length k − 1 has a vertex in C, and moreover, the induced subgraph G[C]...