Pages that link to "Item:Q1861582"

The following pages link to A note on greedy algorithms for the maximum weighted independent set problem (Q1861582):

Displaying 41 items.

• Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061) (← links)
• Maximum weighted induced subgraphs (Q279221) (← links)
• On vertex independence number of uniform hypergraphs (Q399512) (← links)
• Bounding the feedback vertex number of digraphs in terms of vertex degrees (Q534359) (← links)
• Slack allocation algorithm for parallel machines (Q666009) (← links)
• An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
• Indirect unstructured hex-dominant mesh generation using tetrahedra recombination (Q722824) (← links)
• Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
• Approximation algorithms for the weighted independent set problem in sparse graphs (Q1028454) (← links)
• An optimal time algorithm for finding a maximum weight independent set in a tree (Q1107326) (← links)
• Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
• Minimum-energy wireless real-time multicast by joint network coding and scheduling optimization (Q1665573) (← links)
• Flow shop scheduling problem with conflict graphs (Q1708533) (← links)
• Algorithm to find a maximum 2-packing set in a cactus (Q1748991) (← links)
• Scheduling jobs on identical machines with agreement graph (Q1761988) (← links)
• Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
• A new distributed approximation algorithm for the maximum weight independent set problem (Q1793873) (← links)
• A branch-and-price approach for the continuous multifacility monotone ordered median problem (Q2106721) (← links)
• Greed is good for deterministic scale-free networks (Q2205637) (← links)
• Facility location with tree topology and radial distance constraints (Q2280295) (← links)
• Hardness of and approximate mechanism design for the bike rebalancing problem (Q2283013) (← links)
• Gene selection via a new hybrid ant colony optimization algorithm for cancer classification in high-dimensional data (Q2283785) (← links)
• MAX for \(k\)-independence in multigraphs (Q2312650) (← links)
• Carpal tunnel syndrome automatic classification: electromyography vs. ultrasound imaging (Q2343069) (← links)
• Open shop scheduling problems with conflict graphs (Q2357137) (← links)
• An exact algorithm for MAX-CUT in sparse graphs (Q2467485) (← links)
• Data dependent worst case bounds for weighted set packing (Q2484341) (← links)
• A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs (Q2576274) (← links)
• Recoverable Values for Independent Sets (Q3012827) (← links)
• GreedyMAX-type Algorithms for the Maximum Independent Set Problem (Q3075512) (← links)
• An algorithm for finding a maximum weighted independent set in an arbitrary graph (Q3210915) (← links)
• (Q3479822) (← links)
• The potential of greed for independence (Q4650180) (← links)
• The maximum volume hard subset model for Poisson processes: simulation aspects (Q4913932) (← links)
• (Q5109886) (← links)
• A PAC Approach to Application-Specific Algorithm Selection (Q5269823) (← links)
• (Q5417623) (← links)
• Simple and local independent set approximation (Q5919021) (← links)
• A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan (Q6164629) (← links)
• Fractional coloring with local demands and applications to degree-sequence bounds on the independence number (Q6615757) (← links)
• Approximation ratio of the min-degree greedy algorithm for maximum independent set on interval and chordal graphs (Q6648269) (← links)