|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 55 occurrences of 32 keywords
|
|
|
|
|
Results
Found 31 publication records. Showing 31 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 3 | Matthew Andrews, Lisa Zhang |
Almost-tight hardness of directed congestion minimization.  |
J. ACM  |
2008 |
DBLP DOI BibTeX RDF |
Hardness of approximation, undirected graphs, congestion minimization |
| 3 | Julia Chuzhoy, Joseph Naor |
New hardness results for congestion minimization and machine scheduling.  |
J. ACM  |
2006 |
DBLP DOI BibTeX RDF |
resource minimization, scheduling, network routing, Hardness of approximation, congestion minimization |
| 3 | Matthew Andrews, Lisa Zhang |
Logarithmic hardness of the directed congestion minimization problem.  |
STOC  |
2006 |
DBLP DOI BibTeX RDF |
directed graphs, hardness of approximation, congestion minimization |
| 3 | Matthew Andrews, Lisa Zhang |
Hardness of the undirected congestion minimization problem.  |
STOC  |
2005 |
DBLP DOI BibTeX RDF |
hardness of approximation, undirected graphs, congestion minimization |
| 3 | Julia Chuzhoy, Joseph Naor |
New hardness results for congestion minimization and machine scheduling.  |
STOC  |
2004 |
DBLP DOI BibTeX RDF |
routing, approximation algorithms, hardness of approximation, machine scheduling, congestion minimization |
| 2 | Qian-Ping Gu, Yong Wang |
Efficient Algorithm for Embedding Hypergraphs in a Cycle.  |
HiPC  |
2003 |
DBLP DOI BibTeX RDF |
Hypergraph embedding in a cycle, communication on rings, link congestion minimization, approximation algorithms |
| 2 | Bo Hu, Malgorzata Marek-Sadowska |
Congestion minimization during placement without estimation.  |
ICCAD  |
2002 |
DBLP DOI BibTeX RDF |
|
| 2 | Maogang Wang, Xiaojian Yang, Majid Sarrafzadeh |
Congestion minimization during placement.  |
IEEE Trans. on CAD of Integrated Circuits and Systems  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Luciana S. Buriol, Michael J. Hirsch, Panos M. Pardalos, Tania Querido, Mauricio G. C. Resende, Marcus Ritt |
A biased random-key genetic algorithm for road congestion minimization.  |
Optimization Letters  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Iradj Ouveysi, Feng Shu 0001, Wei Chen 0015, Gangxiang Shen, Moshe Zukerman |
Topology and routing optimization for congestion minimization in optical wireless networks.  |
Optical Switching and Networking  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Harald Räcke |
Optimal hierarchical decompositions for congestion minimization in networks.  |
STOC  |
2008 |
DBLP DOI BibTeX RDF |
approximating metrics by tree metrics, oblivious routing |
| 1 | Ron Banner, Ariel Orda |
Multipath routing algorithms for congestion minimization.  |
IEEE/ACM Trans. Netw.  |
2007 |
DBLP DOI BibTeX RDF |
computer networks, routing protocols, congestion avoidance |
| 1 | Matthew Andrews, Lisa Zhang |
Hardness of the Undirected Congestion Minimization Problem.  |
SIAM J. Comput.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar |
Hardness of routing with congestion in directed graphs.  |
STOC  |
2007 |
DBLP DOI BibTeX RDF |
all-or-nothing flow, hardness of approximation, multicommodity flow, edge-disjoint paths, integrality gap, congestion minimization |
| 1 | Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta |
(Almost) Tight bounds and existence theorems for single-commodity confluent flows.  |
J. ACM  |
2007 |
DBLP DOI BibTeX RDF |
confluent flow, routing, Approximation algorithms, network flow, tight bounds |
| 1 | Min Pan, Chris C. N. Chu |
IPR: An Integrated Placement and Routing Algorithm.  |
DAC  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ewerson Carvalho, Ney Calazans, Fernando Moraes |
Heuristics for Dynamic Task Mapping in NoC-based Heterogeneous MPSoCs.  |
IEEE International Workshop on Rapid System Prototyping  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Yong Wang |
Efficient Algorithms for Minimum Congestion Hypergraph Embedding in a Cycle.  |
IEEE Trans. Parallel Distrib. Syst.  |
2006 |
DBLP DOI BibTeX RDF |
Hypergraph embedding, communication on rings, edge congestion minimization, approximation algorithms |
| 1 | Zhuoyuan Li, Xianlong Hong, Qiang Zhou, Jinian Bian, Hannah Honghua Yang, Vijay Pitchumani |
Efficient thermal-oriented 3D floorplanning and thermal via planning for two-stacked-die integration.  |
ACM Trans. Design Autom. Electr. Syst.  |
2006 |
DBLP DOI BibTeX RDF |
floorplanning, thermal, 3D IC |
| 1 | Qinghua Liu, Malgorzata Marek-Sadowska |
Semi-Individual Wire-Length Prediction With Application to Logic Synthesis.  |
IEEE Trans. on CAD of Integrated Circuits and Systems  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob R. Minz, Sung Kyu Lim |
Block-level 3-D Global Routing With an Application to 3-D Packaging.  |
IEEE Trans. on CAD of Integrated Circuits and Systems  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ron Banner, Ariel Orda |
Multipath Routing Algorithms for Congestion Minimization.  |
NETWORKING  |
2005 |
DBLP DOI BibTeX RDF |
Optimization, Algorithms, Routing, Congestion, Combinatorics |
| 1 | Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta |
(Almost) tight bounds and existence theorems for confluent flows.  |
STOC  |
2004 |
DBLP DOI BibTeX RDF |
confluent flow, routing, approximation algorithms, network flow, tight bounds |
| 1 | Ameya R. Agnihotri, Patrick H. Madden |
Congestion reduction in traditional and new routing architectures.  |
ACM Great Lakes Symposium on VLSI  |
2003 |
DBLP DOI BibTeX RDF |
non-Manhattan design, congest, steiner trees, global routing |
| 1 | Davide Pandini, Lawrence T. Pileggi, Andrzej J. Strojwas |
Bounding the efforts on congestion optimization for physical synthesis.  |
ACM Great Lakes Symposium on VLSI  |
2003 |
DBLP DOI BibTeX RDF |
optimization, logic synthesis, physical design, technology mapping, routing congestion |
| 1 | Navaratnasothie Selvakkumaran, Phiroze N. Parakh, George Karypis |
Perimeter-degree: a priori metric for directly measuring and homogenizing interconnection complexity in multilevel placement.  |
SLIP  |
2003 |
DBLP DOI BibTeX RDF |
interconnection complexity, multilevel global placement, nonhomogeneity, perimeter-degree, congestion, routability |
| 1 | Davide Pandini, Lawrence T. Pileggi, Andrzej J. Strojwas |
Global and local congestion optimization in technology mapping.  |
IEEE Trans. on CAD of Integrated Circuits and Systems  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Pandini, Lawrence T. Pileggi, Andrzej J. Strojwas |
Congestion-Aware Logic Synthesis.  |
DATE  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jinan Lou, Shashidhar Thakur, Shankar Krishnamoorthy, Henry S. Sheng |
Estimating routing congestion using probabilistic analysis.  |
IEEE Trans. on CAD of Integrated Circuits and Systems  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Maogang Wang, Majid Sarrafzadeh |
On the behavior of congestion minimization during placement.  |
ISPD  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jadranka Skorin-Kapov, Jean-François P. Labourdette |
Rearrangeable multihop lightwave networks: congestion minimization on regular topologies.  |
Telecommunication Systems  |
1998 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #31 of 31 (100 per page; Change: )
|
|