The following pages link to Samir Khuller (Q194031):
Displaying 50 items.
- New approximation results for resource replication problems (Q270001) (← links)
- Addendum to ``An \(O(|V|^{2})\) algorithm for single connectedness'' (Q294778) (← links)
- Performance tradeoffs in structured peer to peer streaming (Q433417) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- Extending planar graph algorithms to \(K_{3,3}\)-free graphs (Q582121) (← links)
- Energy efficient monitoring in sensor networks (Q627527) (← links)
- Relay placement for fault tolerance in wireless networks in higher dimensions (Q632722) (← links)
- Geometric Knapsack problems (Q689105) (← links)
- Equivalence of two linear programming relaxations for broadcast scheduling. (Q703264) (← links)
- Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms (Q722523) (← links)
- Planar graph coloring is not self-reducible, assuming P\(\neq NP\) (Q805625) (← links)
- Approximating the minimal sensor selection for supervisory control (Q853685) (← links)
- On a triangle counting problem (Q909463) (← links)
- Coloring algorithms for \(K_ 5\)-minor free graphs (Q910220) (← links)
- Broadcasting on networks of workstations (Q973010) (← links)
- Broadcasting in heterogeneous networks (Q996702) (← links)
- On computing graph closures (Q1120287) (← links)
- On independent spanning trees (Q1198088) (← links)
- Facility location with dynamic distance functions (Q1282205) (← links)
- Flow in planar graphs with vertex capacities (Q1317474) (← links)
- Designing multi-commodity flow trees (Q1321837) (← links)
- On the parallel complexity of digraph reachability (Q1339381) (← links)
- On-line algorithms for weighted bipartite matching and stable marriages (Q1342235) (← links)
- (Q1386345) (redirect page) (← links)
- Approximation algorithms for connected dominating sets (Q1386346) (← links)
- Centers of sets of pixels (Q1570843) (← links)
- Fault tolerant \(K\)-center problems (Q1575549) (← links)
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Q1586139) (← links)
- The budgeted maximum coverage problem (Q1606925) (← links)
- An \(O(|V|^2)\) algorithm for single connectedness (Q1607003) (← links)
- LP rounding and combinatorial algorithms for minimizing active and busy time (Q1702663) (← links)
- Facility location with red-blue demands (Q1785285) (← links)
- The General Steiner Tree-Star problem. (Q1853139) (← links)
- Improved methods for approximating node weighted Steiner trees and connected dominating sets. (Q1854264) (← links)
- Algorithms for minimizing response time in broadcast scheduling (Q1879255) (← links)
- A simple randomized sieve algorithm for the closest-pair problem (Q1891130) (← links)
- Balancing minimum spanning trees and shortest-path trees (Q1899219) (← links)
- On strongly connected digraphs with bounded cycle length (Q1923587) (← links)
- LP-based approximation for uniform capacitated facility location problem (Q2172086) (← links)
- On scheduling coflows (Q2211360) (← links)
- Min-max correlation clustering via multicut (Q2293081) (← links)
- Data migration on parallel disks: Algorithms and evaluation (Q2369881) (← links)
- On scheduling coflows (extended abstract) (Q2401141) (← links)
- Busy time scheduling on a bounded number of machines (extended abstract) (Q2405306) (← links)
- Revisiting connected dominating sets: an almost optimal local information algorithm (Q2414868) (← links)
- Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds (Q2426104) (← links)
- Improved approximation algorithms for data migration (Q2429330) (← links)
- Landmarks in graphs (Q2563921) (← links)
- An improved approximation algorithm for vertex cover with hard capacities (Q2581755) (← links)
- Algorithms for facility location problems with outliers. (Extended abstract) (Q2768359) (← links)
