On the public citation graph

Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets

0 signed · 63 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11672142_16openalex-snapshot
Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems
inferredcites →https://doi.org/10.1007/3-540-44985-x_19openalex-snapshot
A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs
inferredcites →https://doi.org/10.1007/978-3-540-72792-7_33openalex-snapshot
Robust Combinatorial Optimization with Exponential Scenarios
inferredcites →https://doi.org/10.1007/978-3-642-17572-5_20openalex-snapshot
Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms
inferredcites →https://doi.org/10.1007/bf01588971openalex-snapshot
An analysis of approximations for maximizing submodular set functions—I
inferredcites →https://doi.org/10.1007/bf02392825openalex-snapshot
Clique is hard to approximate within n1−ε
inferredcites →https://doi.org/10.1007/bfb0121195openalex-snapshot
An analysis of approximations for maximizing submodular set functions—II
inferredcites →https://doi.org/10.1007/s00453-011-9596-0openalex-snapshot
Two-stage Robust Network Design with Exponential Scenarios
inferredcites →https://doi.org/10.1007/s10107-013-0705-5openalex-snapshot
Thresholded covering algorithms for robust and max–min optimization
inferredcites →https://doi.org/10.1016/0377-2217(84)90053-5openalex-snapshot
Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses
inferredcites →https://doi.org/10.1016/j.jcss.2004.04.011openalex-snapshot
A tight bound on approximating arbitrary metrics by tree metrics
inferredcites →https://doi.org/10.1016/s0167-6377(03)00062-2openalex-snapshot
A note on maximizing a submodular set function subject to a knapsack constraint
inferredcites →https://doi.org/10.1057/jors.1980.50openalex-snapshot
Combinatorial Optimization
inferredcites →https://doi.org/10.1109/focs.2004.62openalex-snapshot
Stochastic Optimization is (Almost) as easy as Deterministic Optimization
inferredcites →https://doi.org/10.1109/sfcs.2005.42openalex-snapshot
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
inferredcites →https://doi.org/10.1137/0402008openalex-snapshot
On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
inferredcites →https://doi.org/10.1137/0404033openalex-snapshot
Dynamic Steiner Tree Problem
inferredcites →https://doi.org/10.1137/060661946openalex-snapshot
The Online Set Cover Problem
inferredcites →https://doi.org/10.1137/080733991openalex-snapshot
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
inferredcites →https://doi.org/10.1137/090750020openalex-snapshot
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
inferredcites →https://doi.org/10.1137/s0097539700382820openalex-snapshot
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
inferredcites →https://doi.org/10.1137/s0097539792236237openalex-snapshot
When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
inferredcites →https://doi.org/10.1137/s0097539793242618openalex-snapshot
A General Approximation Technique for Constrained Forest Problems
inferredcites →https://doi.org/10.1137/s0097539793243016openalex-snapshot
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
inferredcites →https://doi.org/10.1137/s0097539796314240openalex-snapshot
Improved Approximation Guarantees for Packing and Covering Integer Programs
inferredcites →https://doi.org/10.1137/s0097539799356265openalex-snapshot
On Multidimensional Packing Problems
inferredcites →https://doi.org/10.1142/9789812796936_others05openalex-snapshot
Combinatorial Optimization
inferredcites →https://doi.org/10.1145/1198513.1198522openalex-snapshot
A general approach to online network optimization problems
inferredcites →https://doi.org/10.1145/1361192.1361201openalex-snapshot
Limitations of cross-monotonic cost-sharing schemes
inferredcites →https://doi.org/10.1145/1374376.1374389openalex-snapshot
Optimal approximation for the submodular welfare problem in the value oracle model
inferredcites →https://doi.org/10.1145/258533.258618openalex-snapshot
On-line algorithms for Steiner tree problems (extended abstract)
inferredcites →https://doi.org/10.1145/777412.777419openalex-snapshot
A polynomial-time tree decomposition to minimize congestion
inferredcites →https://doi.org/10.1145/780542.780558openalex-snapshot
The online set cover problem
inferredcites →https://doi.org/10.1287/moor.1100.0463openalex-snapshot
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
inferredcites →https://doi.org/10.1287/moor.2013.0592openalex-snapshot
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
inferredcites →https://doi.org/10.1515/9781400831050openalex-snapshot
Robust Optimization
inferredcites →https://doi.org/10.48550/arxiv.1008.0831openalex-snapshot
Is submodularity testable?

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_23openalex-snapshot
Approximate Multi-matroid Intersection via Iterative Refinement
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_18openalex-snapshot
On the Power of Static Assignment Policies for Robust Facility Location Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-06901-7_17openalex-snapshot
LP-Based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust Optimization
inferred← citeshttps://doi.org/10.1007/s10107-013-0705-5openalex-snapshot
Thresholded covering algorithms for robust and max–min optimization
inferred← citeshttps://doi.org/10.1007/s10107-020-01524-yopenalex-snapshot
Approximate multi-matroid intersection via iterative refinement
inferred← citeshttps://doi.org/10.1007/s10107-023-02004-9openalex-snapshot
LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
inferred← citeshttps://doi.org/10.1016/j.orl.2018.11.002openalex-snapshot
Constrained submodular maximization via greedy local search
inferred← citeshttps://doi.org/10.1016/j.orl.2022.05.001openalex-snapshot
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
inferred← citeshttps://doi.org/10.1109/infocom.2017.8057136openalex-snapshot
One step at a time: Optimizing SDN upgrades in ISP networks
inferred← citeshttps://doi.org/10.1109/inista55318.2022.9894252openalex-snapshot
Fast Algorithm for Big Data Summarization with Knapsack and Partition Matroid Constraints
inferred← citeshttps://doi.org/10.1109/jsyst.2020.2991928openalex-snapshot
PPO-DFK: A Privacy-Preserving Optimization of Distributed Fractional Knapsack With Application in Secure Footballer Configurations
inferred← citeshttps://doi.org/10.1109/mass.2013.60openalex-snapshot
Near Optimal Charging and Scheduling Scheme for Stochastic Event Capture with Rechargeable Sensors
inferred← citeshttps://doi.org/10.1109/tmc.2018.2887381openalex-snapshot
CHASE: Charging and Scheduling Scheme for Stochastic Event Capture in Wireless Rechargeable Sensor Networks
inferred← citeshttps://doi.org/10.1109/tnet.2018.2890248openalex-snapshot
Optimizing Gradual SDN Upgrades in ISP Networks
inferred← citeshttps://doi.org/10.1137/1.9781611973402.110openalex-snapshot
Fast algorithms for maximizing submodular functions
inferred← citeshttps://doi.org/10.1145/1993636.1993740openalex-snapshot
Submodular function maximization via the multilinear relaxation and contention resolution schemes
inferred← citeshttps://doi.org/10.1145/3313276.3316391openalex-snapshot
Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions
inferred← citeshttps://doi.org/10.1145/3570957openalex-snapshot
Robust Algorithms for TSP and Steiner Tree
inferred← citeshttps://doi.org/10.1145/3572840openalex-snapshot
Universal Algorithms for Clustering Problems
inferred← citeshttps://doi.org/10.1287/moor.2014.0656openalex-snapshot
Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
inferred← citeshttps://doi.org/10.1287/moor.2020.1082openalex-snapshot
On the Optimality of Affine Policies for Budgeted Uncertainty Sets
inferred← citeshttps://doi.org/10.1287/trsc.2021.0349openalex-snapshot
Efficient Algorithms for Stochastic Ride-Pooling Assignment with Mixed Fleets
inferred← citeshttps://doi.org/10.48550/arxiv.0912.1045openalex-snapshot
Thresholded Covering Algorithms for Robust and Max-Min Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1105.4593openalex-snapshot
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
inferred← citeshttps://doi.org/10.48550/arxiv.2102.05168openalex-snapshot
Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries
inferred← citeshttps://doi.org/10.7916/d8-1z4d-r784openalex-snapshot
Tractable Policies in Dynamic Robust Optimization
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.