You are currently viewing a new version of our website. To view the old version click .

Algorithms, Volume 6, Issue 1

March 2013 - 11 articles

  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list .
  • You may sign up for email alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.

Articles (11)

  • Article
  • Open Access
21 Citations
12,562 Views
28 Pages

22 March 2013

Portfolio optimization is one of the problems most frequently encountered by financial practitioners. The main goal of this paper is to fill a gap in the literature by providing a well-documented, step-by-step open-source implementation of Critical L...

  • Article
  • Open Access
8 Citations
7,452 Views
8 Pages

Stable Multicommodity Flows

  • Tamás Király and
  • Júlia Pap

18 March 2013

We extend the stable flow model of Fleiner to multicommodity flows. In addition to the preference lists of agents on trading partners for each commodity, every trading pair has a preference list on the commodities that the seller can sell to the buye...

  • Review
  • Open Access
3 Citations
7,402 Views
25 Pages

12 March 2013

Image reconstruction is a key component in many medical imaging modalities. The problem of image reconstruction can be viewed as a special inverse problem where the unknown image pixel intensities are estimated from the observed measurements. Since t...

  • Article
  • Open Access
50 Citations
18,918 Views
19 Pages

18 February 2013

The eccentricity of a node in a graph is defined as the length of a longest shortest path starting at that node. The eccentricity distribution over all nodes is a relevant descriptive property of the graph, and its extreme values allow the derivation...

  • Article
  • Open Access
16 Citations
11,856 Views
17 Pages

18 February 2013

The maximum common connected edge subgraph problem is to find a connected graph with the maximum number of edges that is isomorphic to a subgraph of each of the two input graphs, where it has applications in pattern recognition and chemistry. This pa...

  • Article
  • Open Access
48 Citations
11,647 Views
16 Pages

4 February 2013

We study the problem of finding the minimum-length curvature constrained closed path through a set of regions in the plane. This problem is referred to as the Dubins Traveling Salesperson Problem with Neighborhoods (DTSPN). An algorithm is presented...

  • Article
  • Open Access
9 Citations
8,207 Views
24 Pages

25 January 2013

A graph is said to be an intersection graph if there is a set of objects such that each vertex corresponds to an object and two vertices are adjacent if and only if the corresponding objects have a nonempty intersection. There are several natural gra...

  • Article
  • Open Access
4 Citations
8,703 Views
17 Pages

21 January 2013

The dominating set problem is a core NP-hard problem in combinatorial optimization and graph theory, and has many important applications. Baker [JACM 41,1994] introduces a k-outer planar graph decomposition-based framework for designing polynomial ti...

  • Article
  • Open Access
179 Citations
17,850 Views
14 Pages

Energy Efficient Routing in Wireless Sensor Networks Through Balanced Clustering

  • Stefanos A. Nikolidakis,
  • Dionisis Kandris,
  • Dimitrios D. Vergados and
  • Christos Douligeris

18 January 2013

The wide utilization of Wireless Sensor Networks (WSNs) is obstructed by the severely limited energy constraints of the individual sensor nodes. This is the reason why a large part of the research in WSNs focuses on the development of energy efficien...

  • Article
  • Open Access
3 Citations
7,195 Views
17 Pages

17 January 2013

Principal Component Analysis (PCA) is widely used for identifying the major components of statistically distributed point clouds. Robust versions of PCA, often based in part on the ℓ1 norm (rather than the ℓ2 norm), are increasingly used, especially...

of 2