Search Results - "Parotsidis, Nikos"

A metaheuristic algorithm for large maximum weight independent set problems by Dong, Yuanyuan, Goldberg, Andrew V., Noe, Alexander, Parotsidis, Nikos, Resende, Mauricio G. C., Spaen, Quico

“…Abstract Motivated by a real‐world vehicle routing application, we consider the maximum‐weight independent set problem: given a node‐weighted graph, find a set…”
Get full text

Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor by Cohen-Addad, Vincent, Das, Debarati, Kipouridis, Evangelos, Parotsidis, Nikos, Thorup, Mikkel

“…We consider the numerical taxonomy problem of fitting a positive distance function \mathcal{D}:\binom{S}{2}\rightarrow \mathbb{R}_{> 0} by a tree metric. We…”
Get full text

Sparse certificates for 2-connectivity in directed graphs by Georgiadis, Loukas, Italiano, Giuseppe F., Karanasiou, Aikaterini, Papadopoulos, Charis, Parotsidis, Nikos

“…Motivated by the emergence of large-scale networks in today's applications, we show how to compute efficiently smaller subgraphs that maintain some properties…”
Get full text

Fully Dynamic $k$-Center Clustering Made Simple by Bhattacharya, Sayan, Costa, Martín, Lattanzi, Silvio, Parotsidis, Nikos

“…In this paper, we consider the \emph{metric $k$-center} problem in the fully dynamic setting, where we are given a metric space $(V,d)$ evolving via a sequence…”
Get full text

Fully Dynamic $k$-Clustering with Fast Update Time and Small Recourse by Bhattacharya, Sayan, Costa, Martín, Garg, Naveen, Lattanzi, Silvio, Parotsidis, Nikos

“…In the dynamic metric $k$-median problem, we wish to maintain a set of $k$ centers $S \subseteq V$ in an input metric space $(V, d)$ that gets updated via…”
Get full text

Efficient and Stable Fully Dynamic Facility Location by Bhattacharya, Sayan, Lattanzi, Silvio, Parotsidis, Nikos

“…We consider the classic facility location problem in fully dynamic data streams, where elements can be both inserted and deleted. In this problem, one is…”
Get full text

Dynamic Correlation Clustering in Sublinear Update Time by Cohen-Addad, Vincent, Lattanzi, Silvio, Maggiori, Andreas, Parotsidis, Nikos

“…We study the classic problem of correlation clustering in dynamic node streams. In this setting, nodes are either added or randomly deleted over time, and each…”
Get full text

Erratum to: Design and implementation of a social networking platform for cloud deployment specialists by Magoutis, Kostas, Papoulas, Christos, Papaioannou, Antonis, Karniavoura, Flora, Akestoridis, Dimitrios-Georgios, Parotsidis, Nikos, Korozi, Maria, Leonidis, Asterios, Ntoa, Stavroula, Stephanidis, Constantine

Get full text

Fully Dynamic $k$-Clustering in $\tilde O(k)$ Update Time by Bhattacharya, Sayan, Costa, Martín, Lattanzi, Silvio, Parotsidis, Nikos

“…We present a $O(1)$-approximate fully dynamic algorithm for the $k$-median and $k$-means problems on metric spaces with amortized update time $\tilde O(k)$ and…”
Get full text

Multi-Swap $k$-Means by Beretta, Lorenzo, Cohen-Addad, Vincent, Lattanzi, Silvio, Parotsidis, Nikos

“…The $k$-means++ algorithm of Arthur and Vassilvitskii (SODA 2007) is often the practitioners' choice algorithm for optimizing the popular $k$-means clustering…”
Get full text

Design and implementation of a social networking platform for cloud deployment specialists by Magoutis, Kostas, Papoulas, Christos, Papaioannou, Antonis, Karniavoura, Flora, Akestoridis, Dimitrios-Georgios, Parotsidis, Nikos, Korozi, Maria, Leonidis, Asterios, Ntoa, Stavroula, Stephanidis, Constantine

“…A new discipline at the intersection of the development and operation of software systems known as DevOps has seen significant growth recently. Among the wide…”
Get full text

Planar Reachability Under Single Vertex or Edge Failures by Italiano, Giuseppe F, Karczmarz, Adam, Parotsidis, Nikos

“…In this paper we present an efficient reachability oracle under single-edge or single-vertex failures for planar directed graphs. Specifically, we show that a…”
Get full text

Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor by Cohen-Addad, Vincent, Das, Debarati, Kipouridis, Evangelos, Parotsidis, Nikos, Thorup, Mikkel

“…We consider the numerical taxonomy problem of fitting a positive distance function ${D:{S\choose 2}\rightarrow \mathbb R_{>0}}$ by a tree metric. We want a…”
Get full text

Near-Optimal Correlation Clustering with Privacy by Cohen-Addad, Vincent, Fan, Chenglin, Lattanzi, Silvio, Mitrović, Slobodan, Norouzi-Fard, Ashkan, Parotsidis, Nikos, Tarnawski, Jakub

“…Correlation clustering is a central problem in unsupervised learning, with applications spanning community detection, duplicate detection, automated labelling…”
Get full text

Optimal Decremental Connectivity in Non-Sparse Graphs by Aaman, Anders, Karczmarz, Adam, Łącki, Jakub, Parotsidis, Nikos, Rasmussen, Peter M. R, Thorup, Mikkel

“…We present a dynamic algorithm for maintaining the connected and 2-edge-connected components in an undirected graph subject to edge deletions. The algorithm is…”
Get full text

Online Reciprocal Recommendation with Theoretical Performance Guarantees by Vitale, Fabio, Parotsidis, Nikos, Gentile, Claudio

“…A reciprocal recommendation problem is one where the goal of learning is not just to predict a user's preference towards a passive item (e.g., a book), but to…”
Get full text

Incremental Strong Connectivity and 2-Connectivity in Directed Graphs by Georgiadis, Loukas, Italiano, Giuseppe F, Parotsidis, Nikos

“…In this paper, we present new incremental algorithms for maintaining data structures that represent all connectivity cuts of size one in directed graphs…”
Get full text

Correlation Clustering in Constant Many Parallel Rounds by Cohen-Addad, Vincent, Lattanzi, Silvio, Mitrović, Slobodan, Norouzi-Fard, Ashkan, Parotsidis, Nikos, Tarnawski, Jakub

“…Correlation clustering is a central topic in unsupervised learning, with many applications in ML and data mining. In correlation clustering, one receives as…”
Get full text

New instances for maximum weight independent set from a vehicle routing application by Dong, Yuanyuan, Goldberg, Andrew V, Noe, Alexander, Parotsidis, Nikos, Resende, Mauricio G. C, Spaen, Quico

“…We present a set of new instances of the maximum weight independent set problem. These instances are derived from a real-world vehicle routing problem and are…”
Get full text

A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems by Dong, Yuanyuan, Goldberg, Andrew V, Noe, Alexander, Parotsidis, Nikos, Resende, Mauricio G. C, Spaen, Quico

“…Motivated by a real-world vehicle routing application, we consider the maximum-weight independent set problem: Given a node-weighted graph, find a set of…”
Get full text