Zachary Friggstad

Algorithmica, August, 2024

Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii.

[BibT_eX]

[DOI]

Mahya Jamshidian

CoRR, 2024

Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs.

[BibT_eX]

[DOI]

Ian DeHaan

CoRR, 2024

Approximating TSP Variants Using a Bridge Lemma.

[BibT_eX]

[DOI]

CoRR, 2024

A QPTAS for Facility Location on Unit Disk graphs.

[BibT_eX]

[DOI]

Hao Sun

CoRR, 2024

A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree.

[BibT_eX]

[DOI]

Hao Sun

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Approximating Minimum Sum Coloring with Bundles.

[BibT_eX]

[DOI]

Seyed Parsa Darbouy

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

2023

Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs.

[BibT_eX]

[DOI]

Ian DeHaan

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

A Parameterized Approximation Scheme for Generalized Partial Vertex Cover.

[BibT_eX]

[DOI]

Sayan Bandyapadhyay

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2023

2022

A constant-factor approximation for directed latency in quasi-polynomial time.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

On Narrative Information and the Distillation of Stories.

[BibT_eX]

[DOI]

CoRR, 2022

Preface.

[BibT_eX]

[DOI]

Jean-Lou De Carufel

Comput. Geom., 2022

Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands.

[BibT_eX]

[DOI]

Mirmahdi Rahgoshay

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters.

[BibT_eX]

[DOI]

Mahya Jamshidian

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Parameterized Approximation Algorithms for K-center Clustering and Variants.

[BibT_eX]

[DOI]

Sayan Bandyapadhyay

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Improved Approximations for CVRP with Unsplittable Demands.

[BibT_eX]

[DOI]

Mirmahdi Rahgoshay

CoRR, 2021

Automatic Embedding of Stories Into Collections of Independent Media.

[BibT_eX]

[DOI]

CoRR, 2021

Special Issue on Algorithms and Data Structures (WADS 2019).

[BibT_eX]

[DOI]

Jörg-Rüdiger Sack

Algorithmica, 2021

Fair Correlation Clustering with Global and Local Guarantees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Graph Pricing with Limited Supply.

[BibT_eX]

[DOI]

Maryam Mahboub

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Preface.

[BibT_eX]

[DOI]

Jörg-Rüdiger Sack

Comput. Geom., 2020

2019

Approximation Schemes for Clustering with Outliers.

[BibT_eX]

[DOI]

Kamyar Khodamoradi

ACM Trans. Algorithms, 2019

Local Search Yields a PTAS for k-Means in Doubling Metrics.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

Scheduling problems over a network of machines.

[BibT_eX]

[DOI]

Arnoosh Golestanian

Kamyar Khodamoradi

Christopher S. Martin

Mirmahdi Rahgoshay

Yifeng Zhang

J. Sched., 2019

LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design.

[BibT_eX]

[DOI]

José A. Soto

Algorithmica, 2019

Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median.

[BibT_eX]

[DOI]

Babak Behsaz

Rohit Sivakumar

Algorithmica, 2019

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS.

[BibT_eX]

[DOI]

Kamyar Khodamoradi

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Approximation Algorithms for Minimum-Load k-Facility Location.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Lift-and-Project Methods for Set Cover and Knapsack.

[BibT_eX]

[DOI]

Eden Chlamtác

Konstantinos Georgiou

Algorithmica, 2018

Orienteering Algorithms for Generating Travel Itineraries.

[BibT_eX]

[DOI]

Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, 2018

Using biconnected components for efficient identification of upstream features in large spatial networks (GIS cup).

[BibT_eX]

[DOI]

Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2018

2017

Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs.

[BibT_eX]

[DOI]

Sara Ahmadian

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

An Improved Integrality Gap for Asymmetric TSP Paths.

[BibT_eX]

[DOI]

Anupam Gupta

Mohit Singh

Math. Oper. Res., 2016

Tight Analysis of a Multiple-Swap Heuristic for Budgeted Red-Blue Median.

[BibT_eX]

[DOI]

Yifeng Zhang

CoRR, 2016

Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding.

[BibT_eX]

[DOI]

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs .

[BibT_eX]

[DOI]

Jochen Könemann

Mohammad Shadravan

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Tight Analysis of a Multiple-Swap Heurstic for Budgeted Red-Blue Median.

[BibT_eX]

[DOI]

Yifeng Zhang

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Approximating Minimum-Cost Connected T-Joins.

[BibT_eX]

[DOI]

Joseph Cheriyan

Zhihan Gao

Algorithmica, 2015

On Linear Programming Relaxations for Unsplittable Flow in Trees.

[BibT_eX]

[DOI]

Zhihan Gao

Proceedings of the Approximation, 2015

Minimizing Total Sensor Movement for Barrier Coverage by Non-uniform Sensors on a Line.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2015

2014

A logarithmic approximation for unsplittable flow on line graphs.

[BibT_eX]

[DOI]

Nikhil Bansal

Rohit Khandekar

ACM Trans. Algorithms, 2014

Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing, 2014

Linear Programming Hierarchies Suffice for Directed Steiner Tree.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

Approximation Algorithms for Minimum-Load k-Facility Location.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2014

2013

Asymmetric Traveling Salesman Path and Directed Latency Problems.

[BibT_eX]

[DOI]

Zoya Svitkina

SIAM J. Comput., 2013

Local-Search based Approximation Algorithms for Mobile Facility Location Problems.

[BibT_eX]

[DOI]

Sara Ahmadian

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Multiple Traveling Salesmen in Asymmetric Metrics.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012

Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods

[BibT_eX]

[DOI]

Eden Chlamtác

Zac Friggstad

Konstantinos Georgiou

CoRR, 2012

2011

Minimizing movement in mobile facility location problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

Approximability of Packing Disjoint Cycles.

[BibT_eX]

[DOI]

Algorithmica, 2011

2009

Superabundant Numbers and the Riemann Hypothesis.

[BibT_eX]

[DOI]

Amir Akbary

Am. Math. Mon., 2009

2008

Design of Reconfigurable DFA Architecture.

[BibT_eX]

Hua Li

Fang M. Wang

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2008

2007

Explicit upper bounds for f(n)=Πpω(n) p/p-1.

[BibT_eX]

[DOI]

Amir Akbary

Robert Juricevic

Contributions Discret. Math., 2007

2005

An efficient architecture for the AES mix columns operation.

[BibT_eX]

[DOI]

Hua Li