Approximate separable multichoice optimization over monotone systems (Q2673246): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2021.100629 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3130421935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex separable optimization is not much harder than linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial oracle-time algorithm for convex integer minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear discrete optimization. An algorithmic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient polynomial time approximation scheme for load balancing on uniformly related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for scheduling on uniformly related and identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally Unimodular Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of welfare maximization in congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of games possessing pure-strategy Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum vulnerability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of the Minimum Shared Edges Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths with minimum shared edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized shifted combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unimodular intersection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shifted matroid optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logarithmic approximation for polymatroid congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar 3DM is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Nonlinear Optimization over Weighted Independence Systems / rank
 
Normal rank

Latest revision as of 07:13, 29 July 2024

scientific article
Language Label Description Also known as
English
Approximate separable multichoice optimization over monotone systems
scientific article

    Statements

    Approximate separable multichoice optimization over monotone systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 June 2022
    0 references
    0 references
    combinatorial optimization
    0 references
    load balancing
    0 references
    congestion routing
    0 references
    independence system
    0 references
    matching
    0 references
    approximation algorithm
    0 references
    0 references