Stavros G. Kolliopoulos

Antonis Skarlatos

J. Comb. Optim., May, 2023

Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2023

2022

Resource Time-Sharing for IoT Applications with Deadlines.

[BibT_eX]

[DOI]

Proceedings of the Algorithmics of Wireless Networks, 2022

2021

Single-item lot-sizing with quantity discount and bounded inventory.

[BibT_eX]

[DOI]

Douglas G. Down

Somayye Rostami

Oper. Res. Lett., 2021

2018

Disjoint Paths and Unsplittable Flow.

[BibT_eX]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Irrelevant vertices for the planar Disjoint Paths Problem.

[BibT_eX]

[DOI]

Isolde Adler

Philipp Klaus Krause

Daniel Lokshtanov

Saket Saurabh

Dimitrios M. Thilikos

J. Comb. Theory B, 2017

2016

Integrality gaps for strengthened linear relaxations of capacitated facility location.

[BibT_eX]

[DOI]

Math. Program., 2016

Planar Disjoint-Paths Completion.

[BibT_eX]

[DOI]

Isolde Adler

Dimitrios M. Thilikos

Algorithmica, 2016

2015

Extended Formulation Lower Bounds via Hypergraph Coloring?.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014

Sherali-Adams Gaps, Flow-cover Inequalities and Generalized Configurations for Capacity-constrained Facility Location.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2014

2013

The 2-valued case of makespan minimization with assignment constraints.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Integrality gaps for strengthened LP relaxations of Capacitated and Lower-Bounded Facility Location

[BibT_eX]

[DOI]

CoRR, 2013

Exponential lower bounds on the size of approximate formulations in the natural encoding for Capacitated Facility Location.

[BibT_eX]

[DOI]

CoRR, 2013

2012

An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates.

[BibT_eX]

[DOI]

Jing Wang

ACM Trans. Algorithms, 2012

2011

Tight Bounds for Linkages in Planar Graphs.

[BibT_eX]

[DOI]

Isolde Adler

Philipp Klaus Krause

Daniel Lokshtanov

Saket Saurabh

Dimitrios M. Thilikos

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users.

[BibT_eX]

[DOI]

Dimitris Fotakis

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

2009

Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands.

[BibT_eX]

[DOI]

Algorithmica, 2009

Stackelberg Strategies for Selfish Routing in General Multicommodity Networks.

[BibT_eX]

[DOI]

Algorithmica, 2009

2007

Edge-Disjoint Paths and Unsplittable Flow.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem.

[BibT_eX]

[DOI]

Satish Rao

SIAM J. Comput., 2007

Approximation algorithms for scheduling problems with a modified total weighted tardiness objective.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2007

Partially ordered knapsack and applications to scheduling.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2006

Approximation algorithms for minimizing the total weighted tardiness on a single machine.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

2005

Implementing approximation algorithms for the single-source unsplittable flow problem.

[BibT_eX]

[DOI]

Jingde Du

ACM J. Exp. Algorithmics, 2005

Approximation algorithms for covering/packing integer programs.

[BibT_eX]

[DOI]

Neal E. Young

J. Comput. Syst. Sci., 2005

2004

Approximating disjoint-path problems using packing integer programs.

[BibT_eX]

[DOI]

Math. Program., 2004

Minimum-Cost Single-Source 2-Splittable Flow.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

On Minimizing the Total Weighted Tardiness on a Single Machine.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users.

[BibT_eX]

[DOI]

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

The Efficiency of Optimal Taxes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003

Techniques for scheduling with rejection.

[BibT_eX]

[DOI]

Daniel W. Engels

David R. Karger

Sudipta Sengupta

R. N. Uma

Joel Wein

J. Algorithms, 2003

Approximating covering integer programs with multiplicity constraints.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

2001

Approximation Algorithms for Single-Source Unsplittable Flow.

[BibT_eX]

[DOI]

SIAM J. Comput., 2001

Tight Approximation Results for General Covering Integer Programs.

[BibT_eX]

[DOI]

Neal E. Young

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation.

[BibT_eX]

[DOI]

Mark W. Goudreau

Satish Rao

Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

1999

Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem.

[BibT_eX]

[DOI]

Satish Rao

Proceedings of the Algorithms, 1999

1998

Finding Real-Valued Single-Source Shortest Paths in <i>o(n<sup>3</sup>)</i> Expected Time.

[BibT_eX]

[DOI]

J. Algorithms, 1998

Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997

Improved Approximation Algorithms for Unsplittable Flow Problems.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

Finding Real-Valued Single-Source Shortest Paths.

[BibT_eX]

[DOI]