[go: up one dir, main page]

Khuller et al., 1994 - Google Patents

Designing multi-commodity flow trees

Khuller et al., 1994

View PDF
Document ID
6818222628043444233
Author
Khuller S
Raghavachari B
Young N
Publication year
Publication venue
Information Processing Letters

External Links

Snippet

The traditional multi-commodity flow problem assumes a given flow network in which multiple commodities are to be maximally routed in response to given demands. This paper considers the multi-commodity flow network-design problem: given a set of multi-commodity …
Continue reading at arxiv.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30861—Retrieval from the Internet, e.g. browsers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/20—Handling natural language data
    • G06F17/21—Text processing
    • G06F17/22—Manipulating or registering by use of codes, e.g. in sequence of text characters
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99941—Database schema or data structure
    • Y10S707/99942—Manipulating data structure, e.g. compression, compaction, compilation
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99941—Database schema or data structure
    • Y10S707/99943—Generating database or data structure, e.g. via user interface
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99931—Database or file accessing

Similar Documents

Publication Publication Date Title
US7610367B2 (en) Method for managing networks by analyzing connectivity
Doeringer et al. Routing on longest-matching prefixes
Hochbaum et al. A unified approach to approximation algorithms for bottleneck problems
Arthur et al. Finding all optimal solutions to the reserve site selection problem: formulation and computational analysis
Khuller et al. Designing multi-commodity flow trees
CA2657418A1 (en) Joint optimization of wrapper generation and template detection
US8201144B2 (en) Method and system for distributing software components
Bramandia et al. On incremental maintenance of 2-hop labeling of graphs
Katz et al. Distance labeling schemes for well-separated graph classes
CN101241499A (en) Patricia tree rapid lookup method
CN108183890A (en) The analytic method and system of a kind of data communication protocol
Imafuji et al. Effects of maximum flow algorithm on identifying web community
Bodlaender Dynamic algorithms for graphs with treewidth 2
CN1992674B (en) A Multi-Dimensional Packet Classification Method Based on Multi-Bit Segmentation
Kim et al. A polynomial time approximation scheme for the grade of service steiner minimum tree problem
Cole et al. A fast algorithm for computing steiner edge connectivity
Arge¹ et al. On external-memory planar depth-first search
Larsen Amortized constant relaxed rebalancing using standard rotations
Messeguer Skip trees, an alternative data structure to skip lists in a concurrent approach
Fard et al. Spanning tree approach in all-terminal network reliability expansion
Apostolico et al. Compact recognizers of episode sequences
Wang et al. Discovery of user frequent access patterns on Web usage mining
Khuller et al. Designing multi-commodity flow trees
KR20080008573A (en) Method for Extracting Association Rules from MMML Data
Gerstel et al. Reducing human interactions in web directory searches