Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
dual fitting
Description:
An approximation-algorithm analysis technique that uses a dual linear program to bound the performance of a primal solution.
Primary topic:
Optimization and Search Problems (39%)
Related topics:
Optimization and Search Problems (39%),
Complexity and Algorithms in Graphs (37%)
OpenAlex ID:
keywords/dual-fitting
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
2003
·
Kamal Jain
, Mohammad Mahdian
, et al.
·
Journal of the ACM
·
587
PDF
An online auction framework for dynamic resource provisioning in cloud computing
2014
·
Weijie Shi
, Linquan Zhang
, et al.
·
ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS)
·
140
Resource Augmentation for Weighted Flow-time explained by Dual Fitting
2012
·
S. Anand
, Naveen Garg
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
134
Approximating the two-level facility location problem via a quasi-greedy approach
2006
·
Jiawei Zhang
·
Mathematical Programming
·
117
Strategyproof cost-sharing mechanisms for set cover and facility location games
2003
·
Nikhil R. Devanur
, Milena Mihail
, et al.
·
ACM Conference on Electronic Commerce (EC)
·
100
A Greedy Facility Location Algorithm Analyzed Using Dual Fitting
2001
·
Mohammad Mahdian
, Evangelos Markakis
, et al.
·
Lecture notes in computer science
·
95
An online auction framework for dynamic resource provisioning in cloud computing
2014
·
Weijie Shi
, Linquan Zhang
, et al.
·
ACM SIGMETRICS Performance Evaluation Review
·
88
Near-Optimal Scheduling Mechanisms for Deadline-Sensitive Jobs in Large Computing Clusters
2015
·
Navendu Jain
, Ishai Menache
, et al.
·
ACM Transactions on Parallel Computing
·
74
Strategyproof cost-sharing mechanisms for set cover and facility location games
2004
·
Nikhil R. Devanur
, Milena Mihail
, et al.
·
Decision Support Systems
·
62
An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
2005
·
Guang Xu
, Jinhui Xu
·
Information Processing Letters
·
51
Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k -Median
2023
·
Vincent Cohen-Addad Viallat
, Fabrizio Grandoni
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
47
PDF
Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling
2020
·
Varun Gupta
, Benjamin Moseley
, et al.
·
Mathematics of Operations Research
·
45
Offline and online facility leasing
2013
·
Chandrashekhar Nagarajan
, David P. Williamson
·
Discrete Optimization
·
45
PDF
Near-Optimum Online Ad Allocation for Targeted Advertising
2018
·
Joseph (Seffi) Naor
, David Wajc
·
ACM Transactions on Economics and Computation
·
37
Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters
2012
·
Navendu Jain
, Ishai Menache
, et al.
·
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
·
37
Combinatorial Interpretations of Dual Fitting and Primal Fitting
2004
·
Ari Freund
, Dror Rawitz
·
Lecture notes in computer science
·
36
Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling
2013
·
Kim Thang Nguyen
·
Lecture notes in computer science
·
33
Scheduling Opportunistic Links in Two-Tiered Reconfigurable Datacenters
2021
·
Janardhan Kulkarni
, Stefan Schmid
, et al.
·
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
·
31
PDF
Near-Optimum Online Ad Allocation for Targeted Advertising
2015
·
Joseph (Seffi) Naor
, David Wajc
·
ACM Conference on Economics and Computation (EC)
·
29
PDF
Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems
2014
·
MohammadTaghi Hajiaghayi
, Vahid Liaghat
, et al.
·
Lecture notes in computer science
·
28
An Optimal Randomized Online Algorithm for Reordering Buffer Management
2013
·
Noa Avigdor-Elgrabli
, Yuval Rabani
·
Annual Symposium on Foundations of Computer Science
·
28
PDF
Cycle Cover with Short Cycles
2005
·
Nicole Immorlica
, Mohammad Mahdian
, et al.
·
Lecture notes in computer science
·
28
A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems
2014
·
Cristina G. Fernandes
, Luis A. A. Meira
, et al.
·
Mathematical Programming
·
26
PDF
Fast and Better Distributed MapReduce Algorithms for k-Center Clustering
2015
·
Sungjin Im
, Benjamin Moseley
·
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
·
25
Stochastic Online Scheduling on Unrelated Machines
2017
·
Varun Gupta
, Benjamin Moseley
, et al.
·
Lecture notes in computer science
·
23
Show more works
View as search
Works count:
107
Citation count:
2,251
Year
Topic
Type