🏛️ The Data Structures & Algorithms Crypt

R.I.P. 👻 Ghosted

The Infinite Server Problem

Christian Coester, Elias Koutsoupias, Philip Lazos

cs.DS 🏛 ICALP 📚 8 cites 9 years ago

R.I.P. 👻 Ghosted

Algorithm for an arbitrary-order cumulant tensor calculation in a sliding window of data streams

Krzysztof Domino, Piotr Gawron

cs.DS 🏛 International Journal of Applied Mathematics and Computer Sciences 📚 8 cites 9 years ago

R.I.P. 👻 Ghosted

Multi-dimensional signal approximation with sparse structured priors using split Bregman iterations

Yoann Isaac, Quentin Barthélemy, ... (+3 more)

cs.DS 🏛 Signal Processing 📚 8 cites 9 years ago

R.I.P. 👻 Ghosted

Greedy bi-criteria approximations for $k$-medians and $k$-means

Daniel Hsu, Matus Telgarsky

cs.DS 🏛 arXiv 📚 8 cites 9 years ago

R.I.P. 👻 Ghosted

Hardness of the Pricing Problem for Chains in Barter Exchanges

Benjamin Plaut, John P. Dickerson, Tuomas Sandholm

cs.DS 🏛 arXiv 📚 8 cites 10 years ago

R.I.P. 👻 Ghosted

Compact Trip Representation over Networks

Nieves R. Brisaboa, Antonio Fariña, ... (+2 more)

cs.DS 🏛 SPIRE 📚 8 cites 9 years ago

R.I.P. 👻 Ghosted

$k$-Distinct In- and Out-Branchings in Digraphs

Gregory Gutin, Felix Reidl, Magnus Wahlström

cs.DS 🏛 ICALP 📚 8 cites 9 years ago

R.I.P. 👻 Ghosted

Distributed Coverage Maximization via Sketching

MohammadHossein Bateni, Hossein Esfandiari, Vahab Mirrokni

cs.DS 🏛 arXiv 📚 8 cites 9 years ago

R.I.P. 👻 Ghosted

Below all subsets for Minimal Connected Dominating Set

Daniel Lokshtanov, Michał Pilipczuk, Saket Saurabh

cs.DS 🏛 SIAM Journal on Discrete Mathematics 📚 8 cites 9 years ago

R.I.P. 👻 Ghosted

Explicit linear kernels for packing problems

Valentin Garnero, Christophe Paul, ... (+2 more)

cs.DS 🏛 Algorithmica 📚 8 cites 9 years ago

R.I.P. 👻 Ghosted

Tight Approximation Bounds for the Seminar Assignment Problem

Amotz Bar-Noy, George Rabanca

cs.DS 🏛 ICAOA W 📚 8 cites 9 years ago

R.I.P. 👻 Ghosted

Cost-efficient Scheduling on Machines from the Cloud

Alexander Mäcker, Manuel Malatyali, ... (+2 more)

cs.DS 🏛 ICCOA 📚 8 cites 9 years ago

R.I.P. 👻 Ghosted

Computing the k Nearest-Neighbors for all Vertices via Dijkstra

Sariel Har-Peled

cs.DS 🏛 arXiv 📚 8 cites 9 years ago

R.I.P. 👻 Ghosted

An Improved Algorithm for Incremental DFS Tree in Undirected Graphs

Lijie Chen, Ran Duan, ... (+3 more)

cs.DS 🏛 arXiv 📚 8 cites 9 years ago

R.I.P. 👻 Ghosted

The complexity of tropical graph homomorphisms

Florent Foucaud, Ararat Harutyunyan, ... (+4 more)

cs.DS 🏛 DAM 📚 8 cites 9 years ago

R.I.P. 👻 Ghosted

On the Complexity and Approximability of Budget-Constrained Minimum Cost Flows

Michael Holzhauser, Sven O. Krumke, Clemens Thielen

cs.DS 🏛 IPL 📚 8 cites 9 years ago

R.I.P. 👻 Ghosted

Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems

Andre Linhares, Chaitanya Swamy

cs.DS 🏛 Math. Prog. 📚 8 cites 10 years ago

R.I.P. 👻 Ghosted

Parameterized Complexity and Approximation Issues for the Colorful Components Problems

Riccardo Dondi, Florian Sikora

cs.DS 🏛 ICCE 📚 8 cites 10 years ago

R.I.P. 👻 Ghosted

Lower Bounds on Time-Space Trade-Offs for Approximate Near Neighbors

Alexandr Andoni, Thijs Laarhoven, ... (+2 more)

cs.DS 🏛 arXiv 📚 8 cites 10 years ago

R.I.P. 👻 Ghosted

A Linear Time Parameterized Algorithm for Node Unique Label Cover

Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh

cs.DS 🏛 ESA 📚 8 cites 10 years ago

R.I.P. 👻 Ghosted

Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem

Fritz Bökler, Petra Mutzel

cs.DS 🏛 ICAC W 📚 8 cites 10 years ago

R.I.P. 👻 Ghosted

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

Zachary Friggstad, Jochen Koenemann, Mohammad Shadravan

cs.DS 🏛 Scandinavian Workshop on Algorithm Theory 📚 8 cites 10 years ago

R.I.P. 👻 Ghosted

The $p$-Center Problem in Tree Networks Revisited

Aritra Banik, Binay Bhattacharya, ... (+3 more)

cs.DS 🏛 Scandinavian Workshop on Algorithm Theory 📚 8 cites 10 years ago

R.I.P. 👻 Ghosted

Fast approximation algorithms for $p$-centres in large $δ$-hyperbolic graphs

Katherine Edwards, W. Sean Kennedy, Iraj Saniee

cs.DS 🏛 Algorithmica 📚 8 cites 10 years ago