Sciweavers

10 search results - page 2 / 2
» ciac 2003
Sort
View
CIAC
2003
Springer
89views Algorithms» more  CIAC 2003»
13 years 11 months ago
The Impact of Network Structure on the Stability of Greedy Protocols
Dimitrios Koukopoulos, Marios Mavronicolas, Sotiri...
CIAC
2003
Springer
142views Algorithms» more  CIAC 2003»
13 years 9 months ago
Differential Approximation for Some Routing Problems
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is to minimize the total distance traveled b...
Cristina Bazgan, Refael Hassin, Jérôm...
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
13 years 11 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...
CIAC
2003
Springer
145views Algorithms» more  CIAC 2003»
13 years 11 months ago
Additive Spanners for k-Chordal Graphs
Abstract. In this paper we show that every chordal graph with n vertices and m edges admits an additive 4-spanner with at most 2n−2 edges and an additive 3-spanner with at most O...
Victor Chepoi, Feodor F. Dragan, Chenyu Yan
CIAC
2003
Springer
110views Algorithms» more  CIAC 2003»
13 years 11 months ago
Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete
In the Art Gallery problem, given is a polygonal gallery and the goal is to guard the gallery’s interior or walls with a number of guards that must be placed strategically in the...
Euripides Markou, Stathis Zachos, Christodoulos Fr...