Simultaneously Load Balancing for Every p-norm, With Reassignments

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Information Technology Convergence and Services

• Publication date

  2017-11-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.4230/LIPIcs.ITCS.2017.51
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap

  2016cited by this paper
• Higher Lower Bounds from the 3SUM Conjecture

  2014cited by this paper
• Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries

  2014cited by this paper
• Dynamic Set Intersection

  2014cited by this paper
• Maintaining Assignments Online: Matching, Scheduling, and Flows

  2014cited by this paper
• Orienting Fully Dynamic Graphs with Worst-Case Time Bounds

  2013cited by this paper
• The power of deferral: maintaining a constant-competitive steiner tree online

  2013cited by this paper
• A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs

  2012cited by this paper
• The Power of Recourse for Online MST and TSP

  2012cited by this paper
• Simple deterministic algorithms for fully dynamic maximal matching

  2012cited by this paper
• Robust Algorithms for Preemptive Scheduling

  2011cited by this paper
• An efficient polynomial-time approximation scheme for Steiner forest in planar graphs

  2011cited by this paper
• A Robust PTAS for Machine Covering and Packing

  2010cited by this paper
• The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation

  2007cited by this paper
• Adjacency queries in dynamic sparse graphs

  2007cited by this paper
• Oracles for bounded-length shortest paths in planar graphs

  2006cited by this paper
• On approximately fair allocations of indivisible goods

  2004cited by this paper
• All maximal independent sets and dynamic dominance for sparse graphs

  2004cited by this paper
• Online Scheduling with Bounded Migration

  2004cited by this paper
• Improved Bounds for the Online Scheduling Problem

  2003cited by this paper
• Online Scheduling Revisited

  2000cited by this paper
• Combining fairness with throughput: online routing with multiple objectives

  2000cited by this paper
• Fairness in routing and load balancing

  1999cited by this paper
• Dynamic Representation of Sparse Graphs

  1999cited by this paper
• Load Balancing for Response Time

  1995cited by this paper
• On-Line Load Balancing and Network Flow

  1993cited by this paper
• The competitiveness of on-line assignments

  1992cited by this paper
• Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices

  1991cited by this paper
• Dynamic Steiner Tree Problem

  1991cited by this paper
• Arboricity and Subgraph Listing Algorithms

  1985cited by this paper
• Network structure and minimum degree

  1983cited by this paper

• Dynamic Set Cover with Worst-Case Recourse

  2025cites this paper
• Interval-Constrained Bipartite Matching over Time

  2024cites this paper
• All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method

  2023cites this paper
• Simultaneously Approximating All $\ell_p$-norms in Correlation Clustering

  2023cites this paper
• Dynamic Matching Algorithms Under Vertex Updates

  2022cites this paper
• Online load balancing with general reassignment cost

  2022cites this paper
• Online Graph Matching Problems with a Worst-Case Reassignment Budget

  2020cites this paper
• Improved Bounds for Distributed Load Balancing

  2020cites this paper
• Improved Dynamic Graph Coloring

  2018cites this paper
• A Generalized Matching Reconfiguration Problem

  2018cites this paper
• Reoptimization via Gradual Transformations

  2018cites this paper
• Online Bipartite Matching with Amortized O(log 2 n) Replacements

  2017influential citation