|
Results
Found 29 publication records. Showing 29 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 2 | Andrzej Czygrinow, Michal Hanckowiak |
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families.  |
COCOON  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Degener |
Local, distributed approximation algorithms for geometric assignment problems.  |
|
2010 |
RDF |
|
| 1 | Bastian Degener |
Local, distributed approximation algorithms for geometric assignment problems.  |
|
2010 |
RDF |
|
| 1 | Song Guo, Victor C. M. Leung, Xiaohong Jiang |
Distributed Approximation Algorithms for Longest-Lived Multicast in WANETs with Directional Antennas.  |
IEEE Transactions on Wireless Communications  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Matti Åstrand, Jukka Suomela |
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks.  |
SPAA  |
2010 |
DBLP DOI BibTeX RDF |
edge packing, distributed algorithm, local algorithm, set cover, vertex cover, anonymous network |
| 1 | Roy Friedman, Alex Kogan |
Brief announcement: deterministic dominating set construction in networks with bounded degree.  |
PODC  |
2010 |
DBLP DOI BibTeX RDF |
dominating sets, bounded degree graphs, distributed approximation algorithms |
| 1 | Saurav Pandit, Sriram V. Pemmaraju |
Rapid randomized pruning for fast greedy distributed algorithms.  |
PODC  |
2010 |
DBLP DOI BibTeX RDF |
distributed algorithms, randomized algorithms, greedy algorithms, facility location, primal-dual algorithms, minimum dominating set |
| 1 | Jukka Suomela |
Distributed algorithms for edge dominating sets.  |
PODC  |
2010 |
DBLP DOI BibTeX RDF |
port-numbered network, approximation, edge dominating set |
| 1 | Saurav Pandit, Sriram V. Pemmaraju |
Return of the primal-dual: distributed metric facilitylocation.  |
PODC  |
2009 |
DBLP DOI BibTeX RDF |
bounded message size, approximation algorithms, wireless ad-hoc networks, facility location, unit ball graphs |
| 1 | Saurav Pandit, Sriram V. Pemmaraju, Kasturi R. Varadarajan |
Approximation Algorithms for Domatic Partitions of Unit Disk Graphs.  |
APPROX-RANDOM  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Koufogiannakis, Neal E. Young |
Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality.  |
DISC  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Andreas Wiese, Fenghui Zhang |
Local Algorithms for Edge Colorings in UDGs.  |
WG  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan, Kunal Talwar |
Efficient distributed approximation algorithms via probabilistic tree embeddings.  |
PODC  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jue Hong, Wenzhong Li, Sanglu Lu, Jiannong Cao, Daoxu Chen |
Sleeping Schedule Aware Minimum Transmission Broadcast in Wireless Ad Hoc Networks.  |
ICPADS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Peter Merz, Tim Nonner, Katharina Rupp |
Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs.  |
OPODIS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvi Lotker, Boaz Patt-Shamir, Adi Rosén |
Distributed approximate matching.  |
PODC  |
2007 |
DBLP DOI BibTeX RDF |
distributed algorithms, graph algorithms, dynamic algorithms, maximum matching, distributed approximation algorithms |
| 1 | Andrzej Czygrinow, Michal Hanckowiak |
Distributed Approximation Algorithms in Unit-Disk Graphs.  |
DISC  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska |
Distributed Approximation Algorithms for Planar Graphs.  |
CIAC  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Srinivas, Gil Zussman, Eytan Modiano |
Mobile backbone networks --: construction and maintenance.  |
MobiHoc  |
2006 |
DBLP DOI BibTeX RDF |
disk cover, approximation algorithms, wireless networks, distributed algorithms, controlled mobility |
| 1 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer |
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks.  |
ICDCS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christopher L. Barrett, V. S. Anil Kumar, Madhav V. Marathe, Shripad Thite, Gabriel Istrate |
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks.  |
PerCom Workshops  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Bartal, John W. Byers, Danny Raz |
Fast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control.  |
SIAM J. Comput.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elkin |
Distributed approximation: a survey.  |
SIGACT News  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Peng-Jun Wan, Khaled M. Alzoubi, Ophir Frieder |
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks.  |
MONET  |
2004 |
DBLP DOI BibTeX RDF |
distributed algorithm, wireless ad hoc networks, spanning tree, leader election, connected dominating set, independent set |
| 1 | Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni |
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks.  |
MOBICOM  |
2003 |
DBLP DOI BibTeX RDF |
ad hoc network, approximation algorithm, topology control, graph model, power conservation, graph property |
| 1 | Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang |
Approximation Algorithms for Channel Allocation Problems in Broadcast Networks.  |
RANDOM-APPROX  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder |
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks.  |
HICSS  |
2002 |
DBLP DOI BibTeX RDF |
distributed algorithm, wireless ad hoc networks, spanning tree, leader election, connected dominating set, independent set |
| 1 | Jeroen Valk, Cees Witteveen |
Multi-agent Coordination in Planning.  |
PRICAI  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Homer, Marcus Peinado |
Design and Performance of Parallel and Distributed Approximation Algorithms for Maxcut.  |
J. Parallel Distrib. Comput.  |
1997 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #29 of 29 (100 per page; Change: )
|