:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Harris, David G., Pensyl, Thomas, Srinivasan, Aravind, Trinh, Khoa
Format:	Preprint
Published:	2017
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/1709.06995
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time
by: Harris, David G.
Published: (2023)

Online Dependent Rounding Schemes for Bipartite Matchings, with Applications
by: Joseph, et al.
Published: (2023)

Stochastic Optimization and Learning for Two-Stage Supplier Problems
by: Brubach, Brian, et al.
Published: (2020)

Concentration of Submodular Functions and Read-k Families Under Negative Dependence
by: Duppala, Sharmila, et al.
Published: (2023)

Simple parallel estimation of the partition ratio for Gibbs distributions
by: Harris, David G., et al.
Published: (2025)

A simple $(2+ε)$-approximation for knapsack interdiction
by: Weninger, Noah
Published: (2026)

Differentially private graph coloring
by: Xie, Michael, et al.
Published: (2026)

Barter Exchange with Shared Item Valuations
by: Luque, Juan, et al.
Published: (2024)

Dimension-Free Correlated Sampling for the Hypersimplex
by: Joseph, et al.
Published: (2025)

An O(nlogn) approximate knapsack algorithm
by: Dawes, Nick
Published: (2025)

Proportionally Fair Matching via Randomized Rounding
by: Duppala, Sharmila, et al.
Published: (2024)

An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem
by: Yang, Yang
Published: (2025)

A rounding and clustering-based exact algorithm for the p-center problem
by: Ales, Zacharie, et al.
Published: (2024)

Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication
by: Harris, David G.
Published: (2021)

On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems
by: Sergeev, Ivan
Published: (2024)

A constant time complexity algorithm for the unbounded knapsack problem with bounded coefficients
by: Yang, Yang
Published: (2024)

Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes
by: Brubach, Brian, et al.
Published: (2021)

Simple and efficient four-cycle counting on sparse graphs
by: Burkhardt, Paul, et al.
Published: (2023)

Improved parallel derandomization via finite automata with applications
by: Giliberti, Jeff, et al.
Published: (2024)

Improved linearly ordered colorings of hypergraphs via SDP rounding
by: Louis, Anand, et al.
Published: (2024)

An FPT algorithm for Matching Cut and d-cut
by: Aravind, N R, et al.
Published: (2021)

Pivot based correlation clustering in the presence of good clusters
by: Lolck, David Rasmussen, et al.
Published: (2026)

A faster algorithm for Vertex Cover parameterized by solution size
by: Harris, David G., et al.
Published: (2022)

Stochastic Multi-round Submodular Optimization with Budget
by: Auletta, Vincenzo, et al.
Published: (2024)

Symmetry-breaking symmetry in directed spectral partitioning
by: Pasadakis, Dimosthenis, et al.
Published: (2025)

A new notion of commutativity for the algorithmic Lovász Local Lemma
by: Harris, David G., et al.
Published: (2020)

Mean-field Potts and random-cluster dynamics from high-entropy initializations
by: Blanca, Antonio, et al.
Published: (2024)

Coloring for dispersion: A polynomial-time algorithm for cardinality-constrained 2-anticlustering
by: Tran, Nguyen Khoa, et al.
Published: (2026)

Chromatic correlation clustering via cluster LP
by: Abbasi, Fateme, et al.
Published: (2025)

A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties
by: Xiao, Hanyin, et al.
Published: (2025)

Parameterized Complexity of Path Set Packing
by: Aravind, N. R., et al.
Published: (2022)

The clustered Sparrow algorithm
by: Dumitrescu, Cristian
Published: (2018)

Balanced TSP partitioning
by: Berendsohn, Benjamin Aram, et al.
Published: (2025)

A simpler QPTAS for scheduling jobs with precedence constraints
by: Das, Syamantak, et al.
Published: (2025)

Scalable Algorithms for Approximate DNF Model Counting
by: Burkhardt, Paul, et al.
Published: (2026)

An improvement of degree-based hashing (DBH) graph partition method, using a novel metric
by: Mastikhina, Anna, et al.
Published: (2024)

Near-Optimal Parallel Approximate Counting via Sampling
by: Harris, David G., et al.
Published: (2026)

Dynamic k-center clustering with lifetimes
by: Moretti, Simone, et al.
Published: (2026)

Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
by: Kobayashi, Yasuaki, et al.
Published: (2023)

Sampling permutations satisfying constraints within the lopsided local lemma regime
by: He, Kun, et al.
Published: (2024)