Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree (Q543514): 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/s10878-009-9276-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2119344260 / 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: Balanced vertex-orderings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024792 / 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: A combinatorial theorem in plane geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of approximating the oriented diameter of chordal graphs / 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: Exact and Approximate Algorithms for Scheduling Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Deterministic Maximum Flow Algorithm / 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: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization in geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation algorithms for machine scheduling: Ten open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximum indegree / rank
 
Normal rank

Latest revision as of 05:02, 4 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
scientific article

    Statements

    Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 June 2011
    0 references
    0 references
    graph orientation
    0 references
    degree
    0 references
    approximation algorithm
    0 references
    inapproximability
    0 references
    maximum flow
    0 references
    scheduling
    0 references
    0 references