Searching for authors named "George Karakostas" – sorted by Relevance.
10 documents found, showing 1 through 10.
-
RESULTS ON APPROXIMATION ALGORITHMS
- …for acceptance by the department of computer science…
- Add To MetaCart
-
On the complexity of intersecting finite state automata
- …We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time σ k where σ is the size of the automata. In this work we prove that the assumption that there exists a better algorithm solving the …
- Cited by 2 (0 self) – Add To MetaCart
-
Faster Approximation Schemes for Fractional Multicommodity Flow Problems
- … We present fully polynomial approximation schemes for concurrent multicommodity flow prob-lems that run in time of minimum possible dependency on the number of commodities k. We showthat by modifying the algorithms by Garg & K"onemann [7] and Fleischer [5] we can reduce their running time on …
- Cited by 8 (0 self) – Add To MetaCart
-
Edge pricing of multicommodity networks for heterogeneous selfish users
- …We examine how the selfish behavior of heterogeneous users in a network can be regulated through economic disincentives, i.e., through the introduction of appropriate taxation. One wants to impose taxes on the edges so that any traffic equilibrium reached by the selfish users who are conscious of bo…
- Cited by 16 (3 self) – Add To MetaCart
-
A better approximation ratio for the vertex cover problem
- …We reduce the approximation factor for Vertex Cover to 2 − Θ ( 1 √ log n) (instead of the previous log log n 2 − Θ ( log n), obtained by Bar-Yehuda and Even [2], and by Monien and Speckenmeyer [10]). The improvement of the vanishing factor comes as an application of the recent results of Arora, Rao,…
- Cited by 22 (0 self) – Add To MetaCart
-
Emergency connectivity in ad-hoc networks with selfish nodes
- …Abstract. In multihop wireless networks, the nodes are selfish, in that they try to maximize their own utility without any regards for the overall network-wide outcome. Since a successful transmission between a pair of nodes requires the cooperation of intermediate nodes in order for the transmitted…
- Add To MetaCart
-
A 2+ε Approximation Algorithm for the k-MST Problem
- …For any # > 0 we give a (2+#)-approximation algorithm for the problem of finding a minimum tree spanning any k vertices in a graph (k-MST), improving a 3-approximation algorithm by Garg [5]. As in [5] the algorithm extends to a (2+#)-approximation algorithm for the minimum tour that visits any k ver…
- Add To MetaCart
-
Selfish routing in the presence of side constraints
- …Abstract. The natural approach for describing network flow problems is to introduce side constraints that capture restrictions of a logical or technological nature, e.g., capacity or budgetary constraints. We study the traffic equilibria arising from selfish routing of individual users in networks w…
- Cited by 1 (1 self) – Add To MetaCart
-
The efficiency of optimal taxes
- …Abstract. It is well known that the selfish behavior of users in a network can be regulated through the imposition of the so-called optimal taxes on the network edges. Any traffic equilibrium reached by the selfish users who are conscious of both the travel latencies and the taxes will minimize the …
- Cited by 2 (1 self) – Add To MetaCart
-
Selfish Routing with Oblivious Users
- …Abstract. We consider the problem of characterizing user equilibria and optimal solutions for selfish routing in a given network. We extend the known models by considering users oblivious to congestion. While in the typical selfish routing setting the users follow a strategy that minimizes their ind…
- Cited by 1 (0 self) – Add To MetaCart
Showing 1 through 10.
