Maximum disjoint set

In computational geometry, a maximum disjoint set (MDS) is a largest set of non-overlapping geometric shapes selected from a given set of candidate… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2005-2017
01220052017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Motivated by the bus escape routing problem in printed circuit boards (PCBs), we study the following optimization problem: given… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2017
2017
We address a classical problem concerning energy efficiency in sensor networks. In particular, we consider the problem of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2015
2015
Given a universe U of n elements and a collection of subsets S of U, the maximum disjoint set cover problem (DSCP) is to… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2014
2014
We consider the problem of finding a maximum disjoint set of boundary rectangles, where all rectangles are attached to the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
We consider the problem of maximizing the lifetime of coverage (MLCP) of targets in a wireless sensor network with battery… (More)
Is this relevant?
2011
2011
One of the critical issues in wireless sensor network is the lifetime of the network. Since each sensor is equipped with a… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Given a k-uniform hypergraph, the Maximum k -Set Packing problem is to find the maximum disjoint set of edges. We prove that this… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
A critical aspect of applications with wireless sensor networks is network lifetime. Battery-powered sensors are usable as long… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?