#### Filter Results:

- Full text PDF available (13)

#### Publication Year

1982

2012

- This year (0)
- Last 5 years (1)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
- ACM Journal of Experimental Algorithmics
- 2007

We consider two approaches that model timetable information in public transportation systems as shortest-path problems in weighted graphs. In the <i>time-expanded</i> approach, every event at a station, e.g., the departure of a train, is modeled as a node in the graph, while in the <i>time-dependent</i> approach the graph contains only one node per station.… (More)

- Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
- ALENEX/ANALC
- 2004

We consider two approaches that model timetable information in public transportation systems as shortest-path problems in weighted graphs. In the time-expanded approach every event at a station, e.g., the departure of a train, is modeled as a node in the graph, while in the time-dependent approach the graph contains only one node per station. Both… (More)

We consider the Railway Traveling Salesman Problem (RTSP) in which a salesman using the railway network wishes to visit a certain number of cities to carry out his/her business, starting and ending at the same city, and having as goal to minimize the overall time of the journey. RTSP is an N P-hard problem. Although it is related to the Generalized… (More)

We describe a new technique for proving the existence of small-nets for hypergraphs satisfying certain simple conditions. The technique is particularly useful for proving o(1 log 1) upper bounds which is not possible using the standard VC dimension theory. We apply the technique to several geometric hypergraphs and obtain simple proofs for the existence of… (More)

- Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
- Electr. Notes Theor. Comput. Sci.
- 2004

We consider optimal itinerary problems in timetable information systems supporting a vast number of on-line queries. We exhibit two important extensions of the time-dependent approach to model realistic versions of the Earliest Arrival and Minimum Number of Transfer problems, as well as of a combination of them, that could not be modeled by the original… (More)

- George Christodoulou, Kurt Mehlhorn, Evangelia Pyrga
- Algorithmica
- 2011

We reconsider the well-studied Selfish Routing game with affine latency functions. The Price of Anarchy for this class of games takes maximum value 4/3; this maximum is attained already for a simple network of two parallel links, known as Pigou’s network. We improve upon the value 4/3 by means of Coordination Mechanisms. We increase the latency functions of… (More)

We continue the study of the effects of selfish behavior in the network design problem. We provide new bounds for the price of stability for network design with fair cost allocation for undirected graphs. We consider the most general case, for which the best known upper bound is the Harmonic number H n , where n is the number of agents, and the best… (More)

- Craig Gotsman, Kanela Kaligosi, Kurt Mehlhorn, Dimitrios Michail, Evangelia Pyrga
- Computer Aided Geometric Design
- 2007

Point samples of a surface in R 3 are the dominant output of a multitude of 3D scanning devices. The usefulness of these devices rests on being able to extract properties of the surface from the sample. We show that, under certain sampling conditions, the minimum cycle basis of a nearest neighbor graph of the sample encodes topological information about the… (More)

- Evangelia Pyrga, Saurabh Ray
- Symposium on Computational Geometry
- 2008

We describe a new technique for proving the existence of small μ-nets for hypergraphs satisfying certain simple conditions. The technique is particularly useful for proving <i>o</i>(1/μ log 1/μ) upper bounds which the standard VC-dimension theory does not allow. We apply the technique to several geometric hypergraphs and obtain simple proofs… (More)

- Christine Chung, Evangelia Pyrga
- SAGT
- 2009

Congestion control at bottleneck routers on the internet is a long standing problem. Many policies have been proposed for effective ways to drop packets from the queues of these routers so that network endpoints will be inclined to share router capacity fairly and minimize the overflow of packets trying to enter the queues. We study just how effective some… (More)