Approximation algorithms for vertex happiness (Q2326078): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963480423 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1606.03185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of homophyly of networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for the maximum happy vertices and edges problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy splitting algorithms for approximating multiway partition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Submodular Multiway Partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiway cuts in node weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound of \(8/(7+\frac{1}{k-1})\) on the integrality ratio of the Călinescu-Karloff-Rabani relaxation for multiway cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding algorithms for a geometric embedding of minimum multiway cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplex partitioning via exponential clocks and the multiway cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiway cut, pairwise realizable distributions, and descending thresholds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Graph Homomorphism Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Cost Allocation Problem and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial auctions with decreasing marginal utilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for combinatorial auctions with submodular bidders / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Maximizing Welfare When Utility Functions Are Subadditive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability results for combinatorial auctions with submodular utility functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry and Approximability of Submodular Maximization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three short proofs in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002828 / rank
 
Normal rank

Revision as of 13:50, 20 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for vertex happiness
scientific article

    Statements

    Approximation algorithms for vertex happiness (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 October 2019
    0 references
    vertex happiness
    0 references
    multi-labeling
    0 references
    submodular/supermodular set function
    0 references
    approximation algorithm
    0 references
    polynomial-time reduction
    0 references
    integrality gap
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references