Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-014-9565-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044147076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRAPH ORIENTATION TO MAXIMIZE THE MINIMUM WEIGHTED OUTDEGREE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Orientations Optimizing the Number of Light or Heavy Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of approximating bounded variants of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar orientations with low out-degree and compaction of adjacency matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly connected orientations of mixed multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph balancing: a special case of scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Maximum Clique by Removing Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3085455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper degree-constrained partial orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond the flow decomposition barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degrees of the vertices of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time primal network simplex algorithm for minimum cost flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max flows in O(nm) time, or better / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-approximability results for optimization problems on bounded degree instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximum indegree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the greedy algorithm for the submodular set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Latest revision as of 16:15, 11 July 2024

scientific article
Language Label Description Also known as
English
Degree-constrained graph orientation: maximum satisfaction and minimum violation
scientific article

    Statements

    Degree-constrained graph orientation: maximum satisfaction and minimum violation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 March 2016
    0 references
    graph orientation
    0 references
    degree constraint
    0 references
    inapproximability
    0 references
    submodular function
    0 references
    greedy algorithm
    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