Kolliopoulos, Stavros - Department of Informatics and Telecommunications, University of Athens

Advanced Search

Kolliopoulos, Stavros - Department of Informatics and Telecommunications, University of Athens

Techniques for Scheduling with Rejection Daniel W. Engels David R. Karger y Stavros G. Kolliopoulos z
EXACT AND APPROXIMATION ALGORITHMS FOR NETWORK FLOW AND DISJOINTPATH
APPROXIMATION ALGORITHMS FOR SINGLE-SOURCE UNSPLITTABLE FLOW
Edge-disjoint Paths and Unsplittable Flow Stavros G. Kolliopoulos
A nearly linear-time approximation scheme for the Euclidean k-median problem
Tight Approximation Results for General Covering Integer Programs Stavros G. Kolliopoulos 1
Edge pricing of multicommodity networks for selfish users with elastic demands
Finding RealValued SingleSource Shortest Paths in o(n 3 ) Expected Time
On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users
Selfish routing in the presence of side constraints George Karakostas # and Stavros G. Kolliopoulos ##
Experimental evaluation of approximation algorithms for singlesource unsplittable flow
An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates
Scheduling Algorithms for InputQueued Switches: Randomized Techniques and Experimental Evaluation
Journal of Computer and System Sciences 71 (2005) 495505 www.elsevier.com/locate/jcss
Partially-Ordered Knapsack and Applications to Scheduling Stavros G. Kolliopoulos
Approximation algorithms for minimizing the total weighted tardiness on a single machine
Information Processing Letters 94 (2005) 1518 www.elsevier.com/locate/ipl
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
The efficiency of optimal taxes George Karakostas1 Stavros G. Kolliopoulos2
Stackelberg strategies for selfish routing in general multicommodity George Karakostas
Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem
Implementing Approximation for the SingleSource Unsplittable
PartiallyOrdered Knapsack and Applications to Scheduling Stavros G. Kolliopoulos # George Steiner +
Approximating Disjoint-Path Problems Using Packing Integer Stavros G. Kolliopoulos 1 Cli ord Stein 2