Stavros G. Kolliopoulos

Publication Activity (10 Years)

Years Active: 1996-2023
Publications (10 Years): 10

Top Topics

Integrality Gap

Top Venues

Oper. Res. Lett.

J. Comb. Optim.

Publications

Stavros G. Kolliopoulos, Antonis Skarlatos
Precedence-constrained covering problems with multiplicity constraints. J. Comb. Optim. 45 (4) (2023)
George Karakostas, Stavros G. Kolliopoulos
Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines. APPROX/RANDOM (2023)
George Karakostas, Stavros G. Kolliopoulos
Resource Time-Sharing for IoT Applications with Deadlines. ALGOSENSORS (2022)
Douglas G. Down, George Karakostas, Stavros G. Kolliopoulos, Somayye Rostami
Single-item lot-sizing with quantity discount and bounded inventory. Oper. Res. Lett. 49 (6) (2021)
Stavros G. Kolliopoulos, Antonis Skarlatos
Precedence-Constrained Covering Problems with Multiplicity Constraints. WAOA (2021)
Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
Irrelevant vertices for the planar Disjoint Paths Problem. J. Comb. Theory, Ser. B 122 (2017)
Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos
Planar Disjoint-Paths Completion. Algorithmica 76 (2) (2016)
Stavros G. Kolliopoulos, Yannis Moysoglou
Integrality gaps for strengthened linear relaxations of capacitated facility location. Math. Program. 158 (1-2) (2016)
Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos
Planar Disjoint-Paths Completion. CoRR (2015)
Stavros G. Kolliopoulos, Yannis Moysoglou
Extended Formulation Lower Bounds via Hypergraph Coloring?. STACS (2015)
Stavros G. Kolliopoulos, Yannis Moysoglou
Extended Formulation Lower Bounds via Hypergraph Coloring? CoRR (2014)
Stavros G. Kolliopoulos, Yannis Moysoglou
Sherali-Adams Gaps, Flow-cover Inequalities and Generalized Configurations for Capacity-constrained Facility Location. APPROX-RANDOM (2014)
Stavros G. Kolliopoulos, Yannis Moysoglou
The 2-valued case of makespan minimization with assignment constraints. Inf. Process. Lett. 113 (1-2) (2013)
Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
Irrelevant Vertices for the Planar Disjoint Paths Problem. CoRR (2013)
Stavros G. Kolliopoulos, Yannis Moysoglou
Exponential lower bounds on the size of approximate formulations in the natural encoding for Capacitated Facility Location. CoRR (2013)
Stavros G. Kolliopoulos, Yannis Moysoglou
Sherali-Adams gaps, flow-cover inequalities and generalized configurations for capacity-constrained Facility Location. CoRR (2013)
Stavros G. Kolliopoulos, Yannis Moysoglou
Integrality gaps for strengthened LP relaxations of Capacitated and Lower-Bounded Facility Location CoRR (2013)
George Karakostas, Stavros G. Kolliopoulos, Jing Wang
An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates. ACM Trans. Algorithms 8 (4) (2012)
Stavros G. Kolliopoulos, Yannis Moysoglou
The 2-valued case of makespan minimization with assignment constraints CoRR (2012)
Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos
Planar Disjoint-Paths Completion. IPEC (2011)
Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
Tight Bounds for Linkages in Planar Graphs. ICALP (1) (2011)
Dimitris Fotakis, George Karakostas, Stavros G. Kolliopoulos
On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users. SAGT (2010)
George Karakostas, Stavros G. Kolliopoulos, Jing Wang
An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates. COCOON (2009)
George Karakostas, Stavros G. Kolliopoulos
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands. Algorithmica 53 (2) (2009)
George Karakostas, Stavros G. Kolliopoulos
Stackelberg Strategies for Selfish Routing in General Multicommodity Networks. Algorithmica 53 (1) (2009)
Stavros G. Kolliopoulos, George Steiner
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective. Oper. Res. Lett. 35 (5) (2007)
Stavros G. Kolliopoulos, George Steiner
Partially ordered knapsack and applications to scheduling. Discret. Appl. Math. 155 (8) (2007)
Stavros G. Kolliopoulos, Satish Rao
A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem. SIAM J. Comput. 37 (3) (2007)
George Karakostas, Stavros G. Kolliopoulos
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands. COCOON (2006)
Stavros G. Kolliopoulos, George Steiner
Approximation algorithms for minimizing the total weighted tardiness on a single machine. Theor. Comput. Sci. 355 (3) (2006)
Stavros G. Kolliopoulos, Neal E. Young
Approximation algorithms for covering/packing integer programs. J. Comput. Syst. Sci. 71 (4) (2005)
Stavros G. Kolliopoulos
Minimum-cost single-source 2-splittable flow. Inf. Process. Lett. 94 (1) (2005)
Jingde Du, Stavros G. Kolliopoulos
Implementing approximation algorithms for the single-source unsplittable flow problem. ACM J. Exp. Algorithmics 10 (2005)
Stavros G. Kolliopoulos
Minimum-Cost Single-Source 2-Splittable Flow. Electron. Notes Discret. Math. 17 (2004)
Stavros G. Kolliopoulos, Clifford Stein
Approximating disjoint-path problems using packing integer programs. Math. Program. 99 (1) (2004)
Stavros G. Kolliopoulos, George Steiner
On Minimizing the Total Weighted Tardiness on a Single Machine. STACS (2004)
Stavros G. Kolliopoulos
Minimum-Cost Single-Source 2-Splittable Flow. CTW (2004)
Jingde Du, Stavros G. Kolliopoulos
Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem. WEA (2004)
George Karakostas, Stavros G. Kolliopoulos
The Efficiency of Optimal Taxes. CAAN (2004)
George Karakostas, Stavros G. Kolliopoulos
Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users. FOCS (2004)
Stavros G. Kolliopoulos
Approximating covering integer programs with multiplicity constraints. Discret. Appl. Math. 129 (2-3) (2003)
Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein
Techniques for scheduling with rejection. J. Algorithms 49 (1) (2003)
Stavros G. Kolliopoulos, Neal E. Young
Tight Approximation Results for General Covering Integer Programs CoRR (2002)
Stavros G. Kolliopoulos, George Steiner
Partially-Ordered Knapsack and Applications to Scheduling. ESA (2002)
Stavros G. Kolliopoulos, Neal E. Young
Tight Approximation Results for General Covering Integer Programs. FOCS (2001)
Stavros G. Kolliopoulos, Clifford Stein
Approximation Algorithms for Single-Source Unsplittable Flow. SIAM J. Comput. 31 (3) (2001)
Mark W. Goudreau, Stavros G. Kolliopoulos, Satish Rao
Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation. INFOCOM (2000)
Stavros G. Kolliopoulos, Satish Rao
A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem. ESA (1999)
Stavros G. Kolliopoulos, Clifford Stein
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow. IPCO (1999)
Stavros G. Kolliopoulos, Clifford Stein
Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs. IPCO (1998)
Stavros G. Kolliopoulos, Clifford Stein
Expected Time. J. Algorithms 28 (1) (1998)
Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein
Techniques for Scheduling with Rejection. ESA (1998)
Stavros G. Kolliopoulos, Clifford Stein
Improved Approximation Algorithms for Unsplittable Flow Problems. FOCS (1997)
Stavros G. Kolliopoulos, Clifford Stein
Finding Real-Valued Single-Source Shortest Paths. IPCO (1996)