The following pages link to Michael Segal (Q293192):
Displaying 50 items.
- Enclosing \(k\) points in the smallest axis parallel rectangle (Q293194) (← links)
- Covering a set of points by two axis-parallel boxes (Q294806) (← links)
- Enumerating longest increasing subsequences and patience sorting (Q294846) (← links)
- On bounded leg shortest paths problems (Q633848) (← links)
- Improved approximation algorithms for maximum lifetime problems in wireless networks (Q714776) (← links)
- Maximizing the number of obnoxious facilities to locate within a bounded region (Q733537) (← links)
- On piercing sets of axis-parallel rectangles and rings (Q826115) (← links)
- Selecting distances in arrangements of hyperplanes spanned by points. (Q878011) (← links)
- Fast algorithm for multicast and data gathering in wireless networks (Q963390) (← links)
- Real-time data gathering in sensor networks (Q968174) (← links)
- Low complexity algorithms for optimal consumer push-pull partial covering in the plane (Q1014939) (← links)
- Geometric applications of posets (Q1276942) (← links)
- Maintenance of a piercing set for intervals with applications (Q1402217) (← links)
- (Q1601022) (redirect page) (← links)
- Fast algorithms for approximating distances (Q1601023) (← links)
- Locating battery charging stations to facilitate almost shortest paths (Q1720301) (← links)
- Geographic quorum system approximations (Q1774150) (← links)
- Lower bounds for covering problems (Q1868261) (← links)
- Planar maximum box problem (Q1876598) (← links)
- Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree (Q1879253) (← links)
- Space and speed tradeoffs in TCAM hierarchical packet classification (Q1936252) (← links)
- Improved algorithms for placing undesirable facilities (Q1941958) (← links)
- Discrete rectilinear 2-center problems (Q1975961) (← links)
- Sensor network topology design and analysis for efficient data gathering by a mobile mule (Q2006940) (← links)
- Covering users by a connected swarm efficiently (Q2037819) (← links)
- Finding bounded diameter minimum spanning tree in general graphs (Q2147109) (← links)
- Improved solution to data gathering with mobile mule (Q2205629) (← links)
- Improved competitive performance bounds for CIOQ switches (Q2429338) (← links)
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition (Q2441579) (← links)
- Scheduling problems in transportation networks of line topology (Q2448158) (← links)
- Computing closest and farthest points for a query segment (Q2481974) (← links)
- Message and time efficient multi-broadcast schemes (Q2513670) (← links)
- Obnoxious facility location: complete service with minimal harm (Q2708039) (← links)
- (Q2708487) (← links)
- (Q2753927) (← links)
- (Q2779372) (← links)
- (Q2934664) (← links)
- (Q3024786) (← links)
- (Q3024790) (← links)
- Centdian Computation in Cactus Graphs (Q3143737) (← links)
- Best Effort and Priority Queuing Policies for Buffered Crossbar Switches (Q3511396) (← links)
- Improved Competitive Performance Bounds for CIOQ Switches (Q3541118) (← links)
- Centdian Computation for Sensor Networks (Q3569075) (← links)
- (Q4449249) (← links)
- (Q4472527) (← links)
- Efficient algorithms for centers and medians in interval and circular-arc graphs (Q4537621) (← links)
- (Q4661876) (← links)
- OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS (Q4762912) (← links)
- (Q4825540) (← links)
- ON PIERCING SETS OF AXIS-PARALLEL RECTANGLES AND RINGS (Q4949987) (← links)
